./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:11:54,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:11:54,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:11:54,605 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:11:54,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:11:54,606 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:11:54,607 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:11:54,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:11:54,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:11:54,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:11:54,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:11:54,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:11:54,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:11:54,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:11:54,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:11:54,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:11:54,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:11:54,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:11:54,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:11:54,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:11:54,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:11:54,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:11:54,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:11:54,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:11:54,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:11:54,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:11:54,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:11:54,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:11:54,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:11:54,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:11:54,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:11:54,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:11:54,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:11:54,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:11:54,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:11:54,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:11:54,625 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:11:54,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:11:54,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:11:54,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:11:54,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:11:54,635 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:11:54,635 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:11:54,635 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:11:54,635 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:11:54,636 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:11:54,636 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:11:54,636 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:11:54,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:11:54,636 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:11:54,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:11:54,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:11:54,637 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:11:54,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:11:54,637 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:11:54,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:11:54,637 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:11:54,637 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:11:54,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:11:54,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:11:54,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:11:54,638 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:11:54,638 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:11:54,638 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:11:54,638 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:11:54,639 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:11:54,639 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a2bee874d696cf0b3efef86c5a2ac3b6d5e9dca [2018-11-23 03:11:54,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:11:54,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:11:54,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:11:54,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:11:54,676 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:11:54,677 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i [2018-11-23 03:11:54,722 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/data/1e2d376ef/d12e2809472e40a78ef3c2daa61848af/FLAGe8125f147 [2018-11-23 03:11:55,154 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:11:55,154 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca_true-termination.c.i [2018-11-23 03:11:55,159 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/data/1e2d376ef/d12e2809472e40a78ef3c2daa61848af/FLAGe8125f147 [2018-11-23 03:11:55,168 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/data/1e2d376ef/d12e2809472e40a78ef3c2daa61848af [2018-11-23 03:11:55,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:11:55,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:11:55,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:11:55,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:11:55,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:11:55,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc5ae29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55, skipping insertion in model container [2018-11-23 03:11:55,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:11:55,209 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:11:55,411 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:11:55,419 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:11:55,502 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:11:55,532 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:11:55,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55 WrapperNode [2018-11-23 03:11:55,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:11:55,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:11:55,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:11:55,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:11:55,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:11:55,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:11:55,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:11:55,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:11:55,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... [2018-11-23 03:11:55,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:11:55,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:11:55,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:11:55,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:11:55,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc81d15f-1caf-45b9-b8cf-d989068c35dd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:11:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:11:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:11:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:11:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:11:55,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:11:55,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:11:55,842 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:11:55,842 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 03:11:55,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:55 BoogieIcfgContainer [2018-11-23 03:11:55,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:11:55,843 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:11:55,843 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:11:55,846 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:11:55,847 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:11:55,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:11:55" (1/3) ... [2018-11-23 03:11:55,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61f1f4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:11:55, skipping insertion in model container [2018-11-23 03:11:55,848 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:11:55,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:55" (2/3) ... [2018-11-23 03:11:55,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61f1f4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:11:55, skipping insertion in model container [2018-11-23 03:11:55,849 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:11:55,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:55" (3/3) ... [2018-11-23 03:11:55,850 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_diffterm_alloca_true-termination.c.i [2018-11-23 03:11:55,898 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:11:55,898 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:11:55,898 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:11:55,899 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:11:55,899 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:11:55,899 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:11:55,899 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:11:55,899 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:11:55,899 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:11:55,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 03:11:55,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:11:55,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:55,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:55,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:11:55,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:11:55,937 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:11:55,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 03:11:55,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:11:55,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:55,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:55,939 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:11:55,939 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:11:55,945 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2018-11-23 03:11:55,946 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2018-11-23 03:11:55,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 03:11:55,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:55,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:55,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:55,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:56,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 03:11:56,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:56,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:56,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:56,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:56,086 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-23 03:11:56,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:56,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:11:56,091 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:11:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:11:56,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:11:56,102 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 03:11:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:56,106 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 03:11:56,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:11:56,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 03:11:56,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:11:56,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 03:11:56,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 03:11:56,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 03:11:56,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 03:11:56,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:11:56,113 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:11:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 03:11:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 03:11:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 03:11:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 03:11:56,131 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:11:56,131 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:11:56,131 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:11:56,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 03:11:56,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:11:56,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:56,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:56,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:11:56,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:56,133 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2018-11-23 03:11:56,133 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2018-11-23 03:11:56,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 03:11:56,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:56,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:56,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 03:11:56,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:56,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:56,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 03:11:56,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:56,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:56,412 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-23 03:11:56,589 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-23 03:11:56,744 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 03:11:56,817 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:11:56,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:11:56,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:11:56,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:11:56,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:11:56,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:11:56,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:11:56,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:11:56,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 03:11:56,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:11:56,819 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:11:56,837 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-23 03:11:56,840 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-23 03:11:56,844 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-23 03:11:56,846 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-23 03:11:56,847 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-23 03:11:56,853 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-23 03:11:56,854 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-23 03:11:56,856 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-23 03:11:56,858 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-23 03:11:56,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:56,874 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-23 03:11:56,876 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-23 03:11:56,879 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-23 03:11:57,143 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-23 03:11:57,153 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-23 03:11:57,154 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-23 03:11:57,155 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-23 03:11:57,156 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-23 03:11:57,531 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:11:57,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:11:57,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:57,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:57,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:57,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:57,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:57,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:57,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:57,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:57,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:57,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:57,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:57,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:57,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:57,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:57,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:57,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:57,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:57,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:57,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:57,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:57,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:57,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:57,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:57,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:57,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:57,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:57,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:57,620 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:11:57,644 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 03:11:57,644 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 03:11:57,646 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:11:57,647 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:11:57,647 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:11:57,647 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-11-23 03:11:57,681 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 03:11:57,685 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:11:57,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:57,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:57,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:57,765 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-23 03:11:57,767 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:11:57,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 03:11:57,806 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-23 03:11:57,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:11:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:11:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 03:11:57,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 03:11:57,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:57,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 03:11:57,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:57,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 03:11:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:57,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 03:11:57,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:11:57,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 03:11:57,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 03:11:57,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:11:57,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 03:11:57,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:57,813 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:11:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 03:11:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 03:11:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 03:11:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 03:11:57,814 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:11:57,814 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:11:57,814 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:11:57,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 03:11:57,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:11:57,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:57,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:57,815 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:57,815 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:11:57,815 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 177#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 179#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 189#L372-5 [2018-11-23 03:11:57,815 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 184#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 189#L372-5 [2018-11-23 03:11:57,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 03:11:57,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:57,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:57,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:57,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:57,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:57,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 03:11:57,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:57,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:57,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:57,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 03:11:57,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:57,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:57,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:58,140 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2018-11-23 03:11:58,210 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:11:58,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:11:58,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:11:58,210 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:11:58,210 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:11:58,210 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:11:58,210 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:11:58,210 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:11:58,210 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 03:11:58,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:11:58,211 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:11:58,214 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-23 03:11:58,220 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-23 03:11:58,223 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-23 03:11:58,224 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-23 03:11:58,226 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-23 03:11:58,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:58,228 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-23 03:11:58,230 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-23 03:11:58,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:58,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:58,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:58,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:58,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:58,235 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-23 03:11:58,236 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-23 03:11:58,237 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-23 03:11:58,238 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-23 03:11:58,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:11:58,744 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-23 03:11:58,807 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:11:58,807 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:11:58,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,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-23 03:11:58,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,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-23 03:11:58,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:58,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:58,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:58,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:58,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:58,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,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-23 03:11:58,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:11:58,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:11:58,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:11:58,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:11:58,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:58,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,854 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:58,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:58,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:58,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:58,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:58,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:58,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:58,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:58,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:58,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,881 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:58,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:58,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,883 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:58,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:58,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:58,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:58,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:58,892 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:58,892 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-11-23 03:11:58,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:58,936 INFO L402 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2018-11-23 03:11:58,936 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-11-23 03:11:59,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:59,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:59,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:59,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:59,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:59,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:59,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:59,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:59,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:59,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:11:59,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:59,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:59,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:59,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:59,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:59,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:59,067 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:11:59,078 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:11:59,078 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:11:59,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:11:59,079 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:11:59,080 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:11:59,080 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 Supporting invariants [] [2018-11-23 03:11:59,134 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 03:11:59,137 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:11:59,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:59,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:59,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:59,214 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-23 03:11:59,214 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-23 03:11:59,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 03:11:59,251 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 03:11:59,252 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-23 03:11:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:11:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:11:59,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:11:59,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:59,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 03:11:59,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:59,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 03:11:59,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:59,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 03:11:59,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:11:59,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 03:11:59,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 03:11:59,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 03:11:59,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 03:11:59,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:59,255 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 03:11:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 03:11:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 03:11:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:11:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 03:11:59,258 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 03:11:59,258 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 03:11:59,259 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:11:59,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 03:11:59,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:11:59,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:59,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:59,260 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:59,260 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:11:59,260 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 355#L382 assume !(main_~length1~0 < 1); 356#L382-2 assume !(main_~length2~0 < 1); 353#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 349#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 350#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 363#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 359#L372-1 assume !cstrspn_#t~short210; 360#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209; 345#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 346#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 347#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 348#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 352#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 362#L372-5 [2018-11-23 03:11:59,260 INFO L796 eck$LassoCheckResult]: Loop: 362#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 357#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 358#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 362#L372-5 [2018-11-23 03:11:59,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 03:11:59,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:59,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:59,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:11:59,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:11:59,304 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:59,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 03:11:59,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:59,476 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 03:11:59,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:11:59,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:11:59,477 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 03:11:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:59,555 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-23 03:11:59,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:11:59,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 03:11:59,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 03:11:59,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-23 03:11:59,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 03:11:59,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 03:11:59,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 03:11:59,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:59,557 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 03:11:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 03:11:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 03:11:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 03:11:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 03:11:59,560 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 03:11:59,560 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 03:11:59,560 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:11:59,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 03:11:59,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:11:59,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:59,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:59,561 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:59,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:11:59,561 INFO L794 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 426#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 427#L382 assume !(main_~length1~0 < 1); 428#L382-2 assume !(main_~length2~0 < 1); 425#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 421#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 422#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 440#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 439#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 438#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209; 417#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 418#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 419#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 420#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 423#L369-1 assume !!(49 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 434#L372-5 [2018-11-23 03:11:59,561 INFO L796 eck$LassoCheckResult]: Loop: 434#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 49 != cstrspn_#t~mem208; 429#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 430#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 434#L372-5 [2018-11-23 03:11:59,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 03:11:59,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:59,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:59,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:59,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:59,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:59,583 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 03:11:59,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:59,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:59,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 03:11:59,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:59,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:12:00,095 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 134 [2018-11-23 03:12:00,836 WARN L180 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-23 03:12:00,838 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:12:00,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:12:00,838 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:12:00,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:12:00,838 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:12:00,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:12:00,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:12:00,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:12:00,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 03:12:00,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:12:00,838 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:12:00,843 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-23 03:12:00,847 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-23 03:12:00,849 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-23 03:12:00,851 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-23 03:12:00,853 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-23 03:12:00,853 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-23 03:12:00,854 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-23 03:12:00,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:12:00,856 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-23 03:12:00,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:12:00,858 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-23 03:12:00,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:12:00,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:12:00,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:12:00,862 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-23 03:12:00,863 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-23 03:12:00,865 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-23 03:12:00,866 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-23 03:12:01,010 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 03:12:01,485 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2018-11-23 03:12:02,013 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-23 03:12:02,121 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-23 03:12:02,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:12:02,246 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:12:02,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:12:02,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:12:02,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:12:02,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:12:02,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:12:02,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:12:02,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:12:02,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:12:02,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:12:02,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:12:02,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:12:02,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:12:02,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,281 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-23 03:12:02,281 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-11-23 03:12:02,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,306 INFO L402 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2018-11-23 03:12:02,306 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-11-23 03:12:02,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:12:02,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:12:02,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:12:02,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:12:02,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,410 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:12:02,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:12:02,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:12:02,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:12:02,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,421 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:12:02,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,422 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:12:02,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:12:02,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-23 03:12:02,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:12:02,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:12:02,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:12:02,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:12:02,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:12:02,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:12:02,442 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:12:02,506 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:12:02,506 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:12:02,506 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:12:02,507 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:12:02,507 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:12:02,507 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-23 03:12:02,599 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-23 03:12:02,601 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:12:02,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:12:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:12:02,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:12:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:12:02,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:12:02,654 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-23 03:12:02,655 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-23 03:12:02,655 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:12:02,684 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 03:12:02,685 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-23 03:12:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:12:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:12:02,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:12:02,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:12:02,686 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:12:02,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:12:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:12:02,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:12:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:12:02,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:12:02,738 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-23 03:12:02,738 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:12:02,738 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:12:02,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 03:12:02,761 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-23 03:12:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:12:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:12:02,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:12:02,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:12:02,762 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:12:02,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:12:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:12:02,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:12:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:12:02,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:12:02,804 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-23 03:12:02,804 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 03:12:02,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 03:12:02,833 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-11-23 03:12:02,833 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-23 03:12:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:12:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 03:12:02,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:12:02,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:12:02,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 03:12:02,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:12:02,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 03:12:02,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:12:02,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 03:12:02,835 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:12:02,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-23 03:12:02,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:12:02,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:12:02,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:12:02,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:12:02,835 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:12:02,835 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:12:02,836 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:12:02,836 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:12:02,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:12:02,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:12:02,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:12:02,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:12:02 BoogieIcfgContainer [2018-11-23 03:12:02,840 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:12:02,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:12:02,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:12:02,841 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:12:02,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:55" (3/4) ... [2018-11-23 03:12:02,843 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:12:02,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:12:02,844 INFO L168 Benchmark]: Toolchain (without parser) took 7674.00 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 422.6 MB). Free memory was 950.4 MB in the beginning and 1.3 GB in the end (delta: -375.6 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:12:02,845 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:12:02,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:12:02,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.78 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-23 03:12:02,845 INFO L168 Benchmark]: Boogie Preprocessor took 18.48 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-23 03:12:02,846 INFO L168 Benchmark]: RCFGBuilder took 257.28 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: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:12:02,846 INFO L168 Benchmark]: BuchiAutomizer took 6997.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 266.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.8 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:12:02,846 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:12:02,849 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.78 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 18.48 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 257.28 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: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6997.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 266.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.8 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 149 SDslu, 72 SDs, 0 SdLazy, 101 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp30 div136 bol100 ite100 ukn100 eq161 hnf77 smp96 dnf663 smp32 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 118ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 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...