./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:34,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:34,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:34,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:34,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:34,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:34,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:34,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:34,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:34,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:34,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:34,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:34,311 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:34,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:34,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:34,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:34,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:34,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:34,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:34,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:34,326 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:34,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:34,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:34,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:34,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:34,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:34,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:34,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:34,346 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:34,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:34,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:34,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:34,349 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:34,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:34,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:34,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:34,355 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:34,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:34,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:34,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:34,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:34,392 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:34,392 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:34,392 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:34,392 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:34,392 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:34,392 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:34,395 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:34,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:34,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:34,396 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:34,396 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:34,396 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:34,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:34,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:34,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:34,397 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:34,397 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:34,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:34,397 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:34,397 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:34,398 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:34,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:34,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:34,401 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:34,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:34,401 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:34,401 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:34,402 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:34,405 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 [2018-11-29 00:11:34,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:34,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:34,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:34,470 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:34,470 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:34,471 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:34,531 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd67303d8/ede7a5b5068d4c8b8d706fb679b15639/FLAG9f714df15 [2018-11-29 00:11:35,116 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:35,117 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:35,135 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd67303d8/ede7a5b5068d4c8b8d706fb679b15639/FLAG9f714df15 [2018-11-29 00:11:35,409 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd67303d8/ede7a5b5068d4c8b8d706fb679b15639 [2018-11-29 00:11:35,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:35,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:35,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:35,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:35,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:35,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:35" (1/1) ... [2018-11-29 00:11:35,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1f8fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:35, skipping insertion in model container [2018-11-29 00:11:35,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:35" (1/1) ... [2018-11-29 00:11:35,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:35,481 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:35,861 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:35,874 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:36,010 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:36,078 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:36,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36 WrapperNode [2018-11-29 00:11:36,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:36,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:36,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:36,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:36,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:36,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:36,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:36,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:36,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2018-11-29 00:11:36,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:36,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:36,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:36,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:36,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:36,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:36,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:36,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:36,798 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:36,798 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-29 00:11:36,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:36 BoogieIcfgContainer [2018-11-29 00:11:36,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:36,800 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:36,801 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:36,805 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:36,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:36,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:35" (1/3) ... [2018-11-29 00:11:36,808 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61e6dfe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:36, skipping insertion in model container [2018-11-29 00:11:36,808 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:36,808 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (2/3) ... [2018-11-29 00:11:36,808 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61e6dfe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:36, skipping insertion in model container [2018-11-29 00:11:36,808 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:36,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:36" (3/3) ... [2018-11-29 00:11:36,812 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:36,874 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:36,875 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:36,875 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:36,876 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:36,878 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:36,878 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:36,878 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:36,879 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:36,879 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:36,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-29 00:11:36,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-29 00:11:36,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:36,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:36,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:36,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:36,928 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:36,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-29 00:11:36,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-29 00:11:36,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:36,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:36,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:36,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:36,948 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 12#L581true assume !(main_~length1~0 < 1); 3#L581-2true assume !(main_~length2~0 < 1); 27#L584-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 6#L566true assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 30#L544-4true [2018-11-29 00:11:36,951 INFO L796 eck$LassoCheckResult]: Loop: 30#L544-4true call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 8#L544-1true assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 26#L544-3true cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 30#L544-4true [2018-11-29 00:11:36,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-29 00:11:36,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:36,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:37,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:37,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2018-11-29 00:11:37,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:37,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:37,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:37,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:37,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2018-11-29 00:11:37,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:37,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:37,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:37,474 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-29 00:11:38,642 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2018-11-29 00:11:38,865 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-29 00:11:38,877 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:38,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:38,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:38,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:38,880 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:38,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:38,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:38,880 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:38,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-29 00:11:38,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:38,883 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:38,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:38,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:38,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:38,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:38,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:38,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:38,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:39,618 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-11-29 00:11:40,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:40,616 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:40,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-11-29 00:11:40,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,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-11-29 00:11:40,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:40,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,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-11-29 00:11:40,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:40,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,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-11-29 00:11:40,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:40,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:40,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:40,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:40,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:40,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:40,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:40,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,831 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:40,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,833 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:40,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,854 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:40,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,856 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:40,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:40,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:40,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:40,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:40,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:40,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:40,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:40,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:40,955 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:41,024 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-29 00:11:41,024 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-29 00:11:41,027 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:41,029 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:41,029 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:41,030 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1) = -1*ULTIMATE.start_cstrlen_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 Supporting invariants [] [2018-11-29 00:11:41,178 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-29 00:11:41,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:41,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:41,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:41,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:41,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-29 00:11:41,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2018-11-29 00:11:41,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 4 states. Result 80 states and 111 transitions. Complement of second has 7 states. [2018-11-29 00:11:41,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-29 00:11:41,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-29 00:11:41,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:41,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-29 00:11:41,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:41,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-29 00:11:41,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:41,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2018-11-29 00:11:41,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:11:41,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2018-11-29 00:11:41,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-29 00:11:41,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-29 00:11:41,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-29 00:11:41,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:41,722 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-29 00:11:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-29 00:11:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-29 00:11:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-29 00:11:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-11-29 00:11:41,760 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-29 00:11:41,761 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-29 00:11:41,761 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:41,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2018-11-29 00:11:41,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-29 00:11:41,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:41,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:41,766 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:41,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:41,767 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 244#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 245#L581 assume !(main_~length1~0 < 1); 231#L581-2 assume !(main_~length2~0 < 1); 232#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 237#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 238#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 240#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 241#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 233#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 234#L568-4 [2018-11-29 00:11:41,767 INFO L796 eck$LassoCheckResult]: Loop: 234#L568-4 goto; 250#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 246#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 247#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 235#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 236#L551 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 248#L559 cstrstr_#t~ret16 := cstrncmp_#res; 239#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 234#L568-4 [2018-11-29 00:11:41,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2018-11-29 00:11:41,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:41,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:41,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:41,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2018-11-29 00:11:41,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:41,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:41,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:41,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:41,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:41,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:11:41,939 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:41,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:11:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:11:41,943 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-29 00:11:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:41,987 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-29 00:11:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:11:41,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-11-29 00:11:41,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-29 00:11:41,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2018-11-29 00:11:41,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-29 00:11:41,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-29 00:11:41,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-29 00:11:41,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:41,993 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-29 00:11:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-29 00:11:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-29 00:11:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-29 00:11:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-29 00:11:41,998 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-29 00:11:41,998 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-29 00:11:41,998 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:41,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-29 00:11:41,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-29 00:11:41,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:41,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:42,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:42,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:42,000 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 317#L581 assume !(main_~length1~0 < 1); 299#L581-2 assume !(main_~length2~0 < 1); 300#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 307#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 308#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 312#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 313#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 301#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 302#L568-4 [2018-11-29 00:11:42,000 INFO L796 eck$LassoCheckResult]: Loop: 302#L568-4 goto; 298#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 303#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 296#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 297#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 304#L551 assume !(0 == cstrncmp_~n % 4294967296); 321#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 310#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9; 311#L559 cstrstr_#t~ret16 := cstrncmp_#res; 309#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 302#L568-4 [2018-11-29 00:11:42,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2018-11-29 00:11:42,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,028 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2018-11-29 00:11:42,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:42,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2018-11-29 00:11:42,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:42,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:42,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:42,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-29 00:11:42,746 WARN L180 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-29 00:11:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:11:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:11:42,821 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-29 00:11:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:42,925 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-29 00:11:42,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:11:42,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-11-29 00:11:42,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-29 00:11:42,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2018-11-29 00:11:42,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-29 00:11:42,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-29 00:11:42,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-11-29 00:11:42,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:42,931 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-29 00:11:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-11-29 00:11:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-29 00:11:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-29 00:11:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-29 00:11:42,934 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-29 00:11:42,934 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-29 00:11:42,934 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:42,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-29 00:11:42,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-29 00:11:42,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:42,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:42,939 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:42,939 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:42,939 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 398#L581 assume !(main_~length1~0 < 1); 378#L581-2 assume !(main_~length2~0 < 1); 379#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 387#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 388#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 393#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 394#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 380#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 381#L568-4 goto; 377#L569-2 [2018-11-29 00:11:42,939 INFO L796 eck$LassoCheckResult]: Loop: 377#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 382#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 376#L569 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 377#L569-2 [2018-11-29 00:11:42,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2018-11-29 00:11:42,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:42,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2018-11-29 00:11:42,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2018-11-29 00:11:42,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:43,346 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:11:43,575 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-29 00:11:44,137 WARN L180 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-11-29 00:11:44,706 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-29 00:11:44,709 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:44,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:44,710 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:44,710 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:44,710 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:44,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:44,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:44,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:44,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-29 00:11:44,712 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:44,712 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:44,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:44,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:45,348 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-11-29 00:11:45,584 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-29 00:11:45,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:45,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:45,934 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-29 00:11:46,466 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-29 00:11:46,734 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:46,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:46,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:46,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:46,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:46,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:46,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:46,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:46,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:46,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:46,891 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:46,917 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:11:46,917 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:11:46,918 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:46,918 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:46,922 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:46,922 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2, ULTIMATE.start_cstrstr_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2 - 1*ULTIMATE.start_cstrstr_~s.offset Supporting invariants [] [2018-11-29 00:11:47,097 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-11-29 00:11:47,100 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:47,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:47,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:47,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:47,301 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-29 00:11:47,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-29 00:11:47,421 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 58 transitions. Complement of second has 5 states. [2018-11-29 00:11:47,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-29 00:11:47,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-29 00:11:47,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:47,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:11:47,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:47,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-29 00:11:47,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:47,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2018-11-29 00:11:47,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:47,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2018-11-29 00:11:47,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:11:47,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:11:47,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-29 00:11:47,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:47,428 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-29 00:11:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-29 00:11:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-29 00:11:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-29 00:11:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-29 00:11:47,432 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-29 00:11:47,432 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-29 00:11:47,432 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:11:47,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-29 00:11:47,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:47,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:47,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:47,434 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:47,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:47,434 INFO L794 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 644#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 645#L581 assume !(main_~length1~0 < 1); 621#L581-2 assume !(main_~length2~0 < 1); 622#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 635#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 636#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 642#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 643#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 649#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 640#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 641#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 623#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 624#L568-4 goto; 625#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 626#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 616#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 617#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 627#L551 assume !(0 == cstrncmp_~n % 4294967296); 650#L553-4 [2018-11-29 00:11:47,434 INFO L796 eck$LassoCheckResult]: Loop: 650#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 637#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 629#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 630#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 647#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 650#L553-4 [2018-11-29 00:11:47,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:47,435 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2018-11-29 00:11:47,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:47,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:47,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:47,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2018-11-29 00:11:47,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:47,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:47,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2018-11-29 00:11:47,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:47,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:48,446 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-29 00:11:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:48,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:11:48,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:11:48,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:48,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:48,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:11:48,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-29 00:11:48,858 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-29 00:11:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-29 00:11:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-29 00:11:48,897 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-29 00:11:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:49,138 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-29 00:11:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-29 00:11:49,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2018-11-29 00:11:49,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:49,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2018-11-29 00:11:49,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:11:49,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:11:49,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-29 00:11:49,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:49,143 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-29 00:11:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-29 00:11:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-29 00:11:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-29 00:11:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-29 00:11:49,147 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-29 00:11:49,147 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-29 00:11:49,147 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:11:49,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2018-11-29 00:11:49,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:49,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:49,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:49,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:49,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:49,150 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 847#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 848#L581 assume !(main_~length1~0 < 1); 824#L581-2 assume !(main_~length2~0 < 1); 825#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 836#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 837#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 856#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 852#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 853#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 845#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 846#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 857#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 843#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 844#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 826#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 827#L568-4 goto; 828#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 829#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 819#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 820#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 830#L551 assume !(0 == cstrncmp_~n % 4294967296); 854#L553-4 [2018-11-29 00:11:49,150 INFO L796 eck$LassoCheckResult]: Loop: 854#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 840#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 832#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 833#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 850#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 854#L553-4 [2018-11-29 00:11:49,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:49,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2018-11-29 00:11:49,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:49,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:49,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2018-11-29 00:11:49,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:49,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:49,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:49,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2018-11-29 00:11:49,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:49,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,667 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-29 00:11:50,961 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 227 DAG size of output: 185 [2018-11-29 00:11:51,740 WARN L180 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 141 [2018-11-29 00:11:51,748 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:51,748 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:51,749 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:51,749 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:51,749 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:51,749 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:51,749 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:51,749 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:51,749 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-29 00:11:51,749 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:51,749 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:51,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:51,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:52,946 WARN L180 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2018-11-29 00:11:53,258 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-11-29 00:11:53,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:53,929 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-11-29 00:11:54,116 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-29 00:11:54,492 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:11:54,619 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:11:54,848 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-29 00:11:55,011 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:55,011 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:55,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:55,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:55,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:55,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:55,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,115 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:55,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,128 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:55,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,145 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:55,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,148 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:55,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:55,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,163 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:55,163 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:11:55,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,173 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-29 00:11:55,174 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-29 00:11:55,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:55,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,194 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:55,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:55,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:55,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:55,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:55,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:55,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:55,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:55,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:55,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:55,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:55,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:55,366 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:55,414 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-29 00:11:55,415 INFO L444 ModelExtractionUtils]: 80 out of 85 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-29 00:11:55,415 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:55,416 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:55,416 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:55,416 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-11-29 00:11:56,012 INFO L297 tatePredicateManager]: 49 out of 51 supporting invariants were superfluous and have been removed [2018-11-29 00:11:56,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:56,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:56,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:56,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:56,144 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-29 00:11:56,145 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-29 00:11:56,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 86 states and 99 transitions. Complement of second has 9 states. [2018-11-29 00:11:56,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:11:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-29 00:11:56,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 5 letters. [2018-11-29 00:11:56,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:56,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-29 00:11:56,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:56,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-29 00:11:56,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:56,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 99 transitions. [2018-11-29 00:11:56,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:56,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 63 states and 74 transitions. [2018-11-29 00:11:56,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-29 00:11:56,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-29 00:11:56,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 74 transitions. [2018-11-29 00:11:56,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:56,268 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-29 00:11:56,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 74 transitions. [2018-11-29 00:11:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-29 00:11:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-29 00:11:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-29 00:11:56,272 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-29 00:11:56,272 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-29 00:11:56,272 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:11:56,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2018-11-29 00:11:56,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:56,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:56,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:56,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:56,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:56,275 INFO L794 eck$LassoCheckResult]: Stem: 1296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1294#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1295#L581 assume !(main_~length1~0 < 1); 1270#L581-2 assume !(main_~length2~0 < 1); 1271#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1283#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1284#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1304#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1309#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1305#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1292#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1293#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1300#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1290#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1291#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1272#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1273#L568-4 goto; 1274#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1275#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1307#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1316#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1313#L551 assume !(0 == cstrncmp_~n % 4294967296); 1314#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1310#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9; 1308#L559 cstrstr_#t~ret16 := cstrncmp_#res; 1285#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1286#L568-4 goto; 1269#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1276#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1265#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1266#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1277#L551 assume !(0 == cstrncmp_~n % 4294967296); 1301#L553-4 [2018-11-29 00:11:56,275 INFO L796 eck$LassoCheckResult]: Loop: 1301#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1287#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1279#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 1280#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1297#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1301#L553-4 [2018-11-29 00:11:56,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:56,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2018-11-29 00:11:56,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:56,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:56,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:56,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:56,368 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2018-11-29 00:11:56,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:56,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:56,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:56,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:56,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2018-11-29 00:11:56,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:56,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:56,665 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-11-29 00:11:58,739 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 325 DAG size of output: 258 [2018-11-29 00:11:59,685 WARN L180 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 156 [2018-11-29 00:11:59,688 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:59,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:59,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:59,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:59,688 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:59,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:59,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:59,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:59,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-29 00:11:59,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:59,689 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:59,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:59,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,351 WARN L180 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 144 [2018-11-29 00:12:01,771 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2018-11-29 00:12:01,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:01,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:02,450 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-11-29 00:12:02,834 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-11-29 00:12:03,383 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-29 00:12:03,488 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-29 00:12:04,165 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-11-29 00:12:04,318 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:12:04,374 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:04,375 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:04,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:04,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:04,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,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-11-29 00:12:04,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:04,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:04,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:04,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,495 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:04,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,496 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:04,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:04,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:04,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:04,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,507 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:04,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,509 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:04,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:04,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:04,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:04,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:04,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:04,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:04,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:04,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:04,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:04,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:04,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:04,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:04,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:04,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:04,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:04,715 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:04,793 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-29 00:12:04,793 INFO L444 ModelExtractionUtils]: 76 out of 85 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-29 00:12:04,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:04,795 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:12:04,795 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:04,795 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_4, ULTIMATE.start_cstrncmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_4 - 1*ULTIMATE.start_cstrncmp_~s2.offset Supporting invariants [] [2018-11-29 00:12:06,243 INFO L297 tatePredicateManager]: 81 out of 84 supporting invariants were superfluous and have been removed [2018-11-29 00:12:06,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:12:06,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:06,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:06,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:06,403 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-29 00:12:06,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-29 00:12:06,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 61 states and 70 transitions. Complement of second has 7 states. [2018-11-29 00:12:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:12:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:12:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-29 00:12:06,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-29 00:12:06,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:06,479 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:12:06,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:06,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:06,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:06,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-29 00:12:06,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-29 00:12:06,833 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 79 states and 93 transitions. Complement of second has 9 states. [2018-11-29 00:12:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:12:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:12:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-29 00:12:06,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-29 00:12:06,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:06,835 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:12:06,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:06,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:06,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:06,990 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-29 00:12:06,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-29 00:12:07,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 71 states and 80 transitions. Complement of second has 6 states. [2018-11-29 00:12:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:12:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:12:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-29 00:12:07,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-29 00:12:07,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:07,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 37 letters. Loop has 5 letters. [2018-11-29 00:12:07,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:07,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 10 letters. [2018-11-29 00:12:07,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:07,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 80 transitions. [2018-11-29 00:12:07,066 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:07,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 0 states and 0 transitions. [2018-11-29 00:12:07,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:12:07,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:12:07,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:12:07,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:07,068 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:07,068 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:07,068 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:07,068 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:12:07,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:12:07,069 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:07,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:12:07,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:12:07 BoogieIcfgContainer [2018-11-29 00:12:07,077 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:12:07,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:12:07,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:12:07,078 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:12:07,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:36" (3/4) ... [2018-11-29 00:12:07,085 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:12:07,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:12:07,087 INFO L168 Benchmark]: Toolchain (without parser) took 31672.35 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 454.0 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -287.6 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:07,088 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:07,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:07,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:07,090 INFO L168 Benchmark]: Boogie Preprocessor took 65.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:07,090 INFO L168 Benchmark]: RCFGBuilder took 596.75 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:07,091 INFO L168 Benchmark]: BuchiAutomizer took 30276.99 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 320.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -153.5 MB). Peak memory consumption was 166.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:07,092 INFO L168 Benchmark]: Witness Printer took 7.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:07,097 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 663.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.31 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. * Boogie Preprocessor took 65.75 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 596.75 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30276.99 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 320.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -153.5 MB). Peak memory consumption was 166.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s1 and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 27.7s. Construction of modules took 0.4s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 254 SDtfs, 301 SDslu, 517 SDs, 0 SdLazy, 207 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital292 mio100 ax100 hnf99 lsp97 ukn89 mio100 lsp47 div139 bol100 ite100 ukn100 eq170 hnf76 smp95 dnf141 smp87 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...