./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/substring-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_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/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 29f46a81991b9bc0fef856343662e1cc264d2d45 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:05:48,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:05:48,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:05:48,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:05:48,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:05:48,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:05:48,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:05:48,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:05:48,974 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:05:48,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:05:48,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:05:48,975 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:05:48,976 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:05:48,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:05:48,977 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:05:48,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:05:48,978 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:05:48,980 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:05:48,981 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:05:48,982 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:05:48,983 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:05:48,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:05:48,985 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:05:48,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:05:48,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:05:48,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:05:48,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:05:48,987 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:05:48,988 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:05:48,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:05:48,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:05:48,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:05:48,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:05:48,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:05:48,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:05:48,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:05:48,991 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 02:05:49,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:05:49,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:05:49,002 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:05:49,003 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:05:49,003 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:05:49,003 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:05:49,003 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:05:49,003 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:05:49,003 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:05:49,003 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:05:49,004 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:05:49,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:05:49,004 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:05:49,004 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:05:49,004 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:05:49,004 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:05:49,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:05:49,005 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:05:49,005 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:05:49,005 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:05:49,005 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:05:49,005 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:05:49,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:05:49,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:05:49,006 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:05:49,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:05:49,006 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:05:49,006 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:05:49,007 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:05:49,007 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_257be8f4-77af-4459-a07d-930c87ea186e/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 -> 29f46a81991b9bc0fef856343662e1cc264d2d45 [2018-11-23 02:05:49,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:05:49,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:05:49,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:05:49,041 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:05:49,041 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:05:49,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-11-23 02:05:49,076 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/data/8a7bf3513/0a58cd24eadb435a96751e5bd2adbc23/FLAGda2826a93 [2018-11-23 02:05:49,493 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:05:49,493 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-11-23 02:05:49,500 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/data/8a7bf3513/0a58cd24eadb435a96751e5bd2adbc23/FLAGda2826a93 [2018-11-23 02:05:49,509 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/bin-2019/uautomizer/data/8a7bf3513/0a58cd24eadb435a96751e5bd2adbc23 [2018-11-23 02:05:49,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:05:49,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:05:49,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:05:49,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:05:49,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:05:49,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ab206d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49, skipping insertion in model container [2018-11-23 02:05:49,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:05:49,548 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:05:49,725 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:05:49,734 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:05:49,801 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:05:49,823 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:05:49,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49 WrapperNode [2018-11-23 02:05:49,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:05:49,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:05:49,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:05:49,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:05:49,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:05:49,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:05:49,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:05:49,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:05:49,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... [2018-11-23 02:05:49,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:05:49,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:05:49,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:05:49,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:05:49,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_257be8f4-77af-4459-a07d-930c87ea186e/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 02:05:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:05:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:05:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:05:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:05:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:05:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:05:50,097 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:05:50,097 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 02:05:50,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:50 BoogieIcfgContainer [2018-11-23 02:05:50,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:05:50,098 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:05:50,098 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:05:50,102 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:05:50,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:05:50,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:05:49" (1/3) ... [2018-11-23 02:05:50,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77b784ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:05:50, skipping insertion in model container [2018-11-23 02:05:50,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:05:50,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:49" (2/3) ... [2018-11-23 02:05:50,105 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77b784ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:05:50, skipping insertion in model container [2018-11-23 02:05:50,105 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:05:50,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:50" (3/3) ... [2018-11-23 02:05:50,106 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-termination.c.i [2018-11-23 02:05:50,154 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:05:50,155 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:05:50,155 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:05:50,155 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:05:50,155 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:05:50,155 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:05:50,156 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:05:50,156 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:05:50,156 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:05:50,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 02:05:50,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:05:50,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:05:50,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:05:50,191 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:05:50,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:05:50,191 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:05:50,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 02:05:50,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:05:50,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:05:50,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:05:50,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:05:50,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:05:50,198 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 9#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 8#L568-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 4#L550-3true [2018-11-23 02:05:50,199 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 19#L550-1true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 3#L553-5true assume !true; 5#L553-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 6#L557true assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 4#L550-3true [2018-11-23 02:05:50,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 02:05:50,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:50,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:50,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2018-11-23 02:05:50,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:50,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:50,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:50,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:50,340 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 02:05:50,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:05:50,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:05:50,345 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:05:50,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:05:50,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:05:50,357 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-23 02:05:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:05:50,362 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-23 02:05:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:05:50,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-23 02:05:50,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:05:50,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2018-11-23 02:05:50,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 02:05:50,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 02:05:50,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-23 02:05:50,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:05:50,368 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 02:05:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-23 02:05:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 02:05:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 02:05:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-23 02:05:50,389 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 02:05:50,390 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 02:05:50,390 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:05:50,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-23 02:05:50,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 02:05:50,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:05:50,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:05:50,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:05:50,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:05:50,391 INFO L794 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 44#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 45#L565 assume !(main_~length1~0 < 1); 49#L565-2 assume !(main_~length2~0 < 1); 50#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 51#L550-3 [2018-11-23 02:05:50,391 INFO L796 eck$LassoCheckResult]: Loop: 51#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 52#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 42#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 43#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L553-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 46#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 47#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 51#L550-3 [2018-11-23 02:05:50,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:50,392 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 02:05:50,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:50,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:50,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:50,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2018-11-23 02:05:50,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:05:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:50,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:50,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2018-11-23 02:05:50,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:50,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:50,641 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-11-23 02:05:50,858 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 02:05:50,929 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:05:50,930 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:05:50,930 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:05:50,930 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:05:50,930 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:05:50,930 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:05:50,931 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:05:50,931 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:05:50,931 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 02:05:50,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:05:50,931 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:05:50,948 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 02:05:50,951 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 02:05:50,953 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 02:05:50,955 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 02:05:50,956 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 02:05:50,959 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 02:05:50,962 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 02:05:50,965 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 02:05:50,967 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 02:05:50,969 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 02:05:50,970 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 02:05:50,971 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 02:05:50,973 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 02:05:50,977 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 02:05:50,982 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 02:05:50,983 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 02:05:50,985 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 02:05:50,987 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 02:05:50,988 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 02:05:51,194 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-11-23 02:05:51,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:51,269 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 02:05:51,270 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 02:05:51,272 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 02:05:51,625 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:05:51,629 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:05:51,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:51,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:51,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:51,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:51,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:51,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,684 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:05:51,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,688 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:05:51,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,705 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 02:05:51,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,707 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 02:05:51,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:51,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:51,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:51,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:51,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:51,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:51,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:51,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:51,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:51,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:51,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:51,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:51,765 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:05:51,781 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:05:51,781 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 02:05:51,783 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:05:51,784 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:05:51,784 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:05:51,784 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_substring_~ps~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_substring_~ps~0.offset Supporting invariants [] [2018-11-23 02:05:51,825 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 02:05:51,830 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 02:05:51,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:51,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:51,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:51,897 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 02:05:51,899 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 02:05:51,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 02:05:51,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2018-11-23 02:05:51,941 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 02:05:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:05:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-23 02:05:51,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-23 02:05:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-23 02:05:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-23 02:05:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:51,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-23 02:05:51,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 02:05:51,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2018-11-23 02:05:51,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 02:05:51,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 02:05:51,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-23 02:05:51,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:05:51,946 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 02:05:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-23 02:05:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 02:05:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 02:05:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-11-23 02:05:51,948 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 02:05:51,948 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 02:05:51,948 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:05:51,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-11-23 02:05:51,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 02:05:51,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:05:51,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:05:51,949 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:05:51,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:05:51,949 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 175#L565 assume !(main_~length1~0 < 1); 183#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 178#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 180#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 170#L553-5 [2018-11-23 02:05:51,949 INFO L796 eck$LassoCheckResult]: Loop: 170#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 171#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 170#L553-5 [2018-11-23 02:05:51,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-23 02:05:51,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:51,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:51,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:51,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:51,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2018-11-23 02:05:51,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:51,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:51,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:51,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:51,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2018-11-23 02:05:51,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:52,319 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-23 02:05:52,407 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:05:52,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:05:52,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:05:52,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:05:52,407 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:05:52,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:05:52,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:05:52,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:05:52,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 02:05:52,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:05:52,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:05:52,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,413 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 02:05:52,417 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 02:05:52,419 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 02:05:52,420 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 02:05:52,422 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 02:05:52,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,425 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 02:05:52,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,431 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 02:05:52,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,433 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 02:05:52,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 02:05:52,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:52,438 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 02:05:52,657 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2018-11-23 02:05:52,734 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 02:05:52,736 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 02:05:53,152 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:05:53,152 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:05:53,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:53,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:53,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:53,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:53,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:53,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:53,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:53,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:53,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:53,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,203 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:05:53,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:05:53,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:53,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:53,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,221 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:05:53,221 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:05:53,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,224 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 02:05:53,224 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 02:05:53,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,235 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:05:53,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,237 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:05:53,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:53,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:53,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:53,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:53,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:53,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:53,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:53,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:53,274 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:05:53,296 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 02:05:53,296 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 02:05:53,296 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:05:53,297 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:05:53,297 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:05:53,297 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-23 02:05:53,370 INFO L297 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2018-11-23 02:05:53,372 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 02:05:53,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:53,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:53,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:53,434 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 02:05:53,434 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 02:05:53,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 02:05:53,489 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 40 states and 54 transitions. Complement of second has 6 states. [2018-11-23 02:05:53,490 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 02:05:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:05:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 02:05:53,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 02:05:53,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:53,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 02:05:53,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:53,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 02:05:53,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:53,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2018-11-23 02:05:53,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 02:05:53,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 38 transitions. [2018-11-23 02:05:53,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 02:05:53,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 02:05:53,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2018-11-23 02:05:53,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:05:53,494 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-11-23 02:05:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2018-11-23 02:05:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-11-23 02:05:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 02:05:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-11-23 02:05:53,496 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-23 02:05:53,496 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-23 02:05:53,496 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:05:53,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2018-11-23 02:05:53,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 02:05:53,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:05:53,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:05:53,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:05:53,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:05:53,497 INFO L794 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 378#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 379#L565 assume !(main_~length1~0 < 1); 385#L565-2 assume !(main_~length2~0 < 1); 386#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 387#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 388#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 397#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 399#L553-1 assume !substring_#t~short6; 398#L553-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 392#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 393#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 389#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 391#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 380#L553-5 [2018-11-23 02:05:53,497 INFO L796 eck$LassoCheckResult]: Loop: 380#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 381#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 394#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 380#L553-5 [2018-11-23 02:05:53,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2018-11-23 02:05:53,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:53,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:53,535 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 02:05:53,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:05:53,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:05:53,536 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:05:53,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2018-11-23 02:05:53,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:53,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:53,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:05:53,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:05:53,615 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 02:05:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:05:53,640 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-11-23 02:05:53,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:05:53,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-11-23 02:05:53,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 02:05:53,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 34 transitions. [2018-11-23 02:05:53,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 02:05:53,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 02:05:53,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2018-11-23 02:05:53,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:05:53,642 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-23 02:05:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2018-11-23 02:05:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 02:05:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 02:05:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-11-23 02:05:53,644 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 02:05:53,644 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 02:05:53,645 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:05:53,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-11-23 02:05:53,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 02:05:53,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:05:53,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:05:53,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:05:53,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 02:05:53,648 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 441#L565 assume !(main_~length1~0 < 1); 447#L565-2 assume !(main_~length2~0 < 1); 448#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 449#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 450#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 459#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 461#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 460#L553-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 454#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 455#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 451#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 453#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 442#L553-5 [2018-11-23 02:05:53,648 INFO L796 eck$LassoCheckResult]: Loop: 442#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 443#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 456#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 442#L553-5 [2018-11-23 02:05:53,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:53,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2018-11-23 02:05:53,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:53,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:05:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:53,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:53,668 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2018-11-23 02:05:53,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:53,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:53,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:05:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:53,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2018-11-23 02:05:53,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:53,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:05:53,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:05:54,148 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 138 [2018-11-23 02:05:54,238 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:05:54,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:05:54,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:05:54,239 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:05:54,239 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:05:54,239 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:05:54,239 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:05:54,239 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:05:54,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 02:05:54,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:05:54,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:05:54,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:54,246 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 02:05:54,247 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 02:05:54,248 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 02:05:54,250 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 02:05:54,251 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 02:05:54,252 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 02:05:54,253 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 02:05:54,254 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 02:05:54,255 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 02:05:54,256 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 02:05:54,257 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 02:05:54,258 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 02:05:54,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:54,612 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2018-11-23 02:05:54,761 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-11-23 02:05:54,762 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 02:05:54,763 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 02:05:54,764 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 02:05:54,769 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 02:05:54,770 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 02:05:54,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:54,773 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 02:05:54,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:54,777 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 02:05:54,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:54,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:05:55,232 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-23 02:05:55,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:05:55,370 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:05:55,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:55,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:55,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:55,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:55,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:05:55,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:05:55,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:05:55,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,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 02:05:55,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,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 02:05:55,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,404 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:05:55,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,405 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:05:55,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,412 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-23 02:05:55,412 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:05:55,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,417 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-11-23 02:05:55,417 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 02:05:55,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:55,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:05:55,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:05:55,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:05:55,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:05:55,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:05:55,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:05:55,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:05:55,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:05:55,512 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:05:55,543 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 02:05:55,543 INFO L444 ModelExtractionUtils]: 48 out of 58 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 02:05:55,544 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:05:55,544 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:05:55,544 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:05:55,545 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-23 02:05:55,688 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2018-11-23 02:05:55,691 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 02:05:55,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:55,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:55,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:55,752 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 02:05:55,752 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 02:05:55,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 02:05:55,779 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 38 states and 48 transitions. Complement of second has 6 states. [2018-11-23 02:05:55,780 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 02:05:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:05:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 02:05:55,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 02:05:55,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:55,780 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:05:55,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:55,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:55,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:55,850 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 02:05:55,851 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 02:05:55,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 02:05:55,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 38 states and 48 transitions. Complement of second has 6 states. [2018-11-23 02:05:55,872 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 02:05:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:05:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 02:05:55,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 02:05:55,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:55,873 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:05:55,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:55,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:55,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:05:55,917 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 02:05:55,917 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 02:05:55,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 02:05:55,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 39 states and 51 transitions. Complement of second has 5 states. [2018-11-23 02:05:55,941 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 02:05:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:05:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 02:05:55,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 02:05:55,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:55,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 02:05:55,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:55,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 02:05:55,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:05:55,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2018-11-23 02:05:55,943 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:05:55,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-23 02:05:55,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 02:05:55,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 02:05:55,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 02:05:55,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:05:55,944 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:05:55,944 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:05:55,944 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:05:55,944 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:05:55,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:05:55,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:05:55,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 02:05:55,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:05:55 BoogieIcfgContainer [2018-11-23 02:05:55,948 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 02:05:55,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:05:55,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:05:55,948 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:05:55,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:50" (3/4) ... [2018-11-23 02:05:55,952 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:05:55,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:05:55,953 INFO L168 Benchmark]: Toolchain (without parser) took 6441.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.6 MB). Free memory was 955.4 MB in the beginning and 932.5 MB in the end (delta: 22.9 MB). Peak memory consumption was 360.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:05:55,953 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:05:55,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:05:55,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.41 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:05:55,955 INFO L168 Benchmark]: Boogie Preprocessor took 15.29 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 02:05:55,955 INFO L168 Benchmark]: RCFGBuilder took 229.07 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.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:05:55,955 INFO L168 Benchmark]: BuchiAutomizer took 5849.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 932.5 MB in the end (delta: 181.5 MB). Peak memory consumption was 361.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:05:55,956 INFO L168 Benchmark]: Witness Printer took 3.78 ms. Allocated memory is still 1.4 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:05:55,959 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.41 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.29 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 229.07 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.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5849.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 932.5 MB in the end (delta: 181.5 MB). Peak memory consumption was 361.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.78 ms. Allocated memory is still 1.4 GB. Free memory is still 932.5 MB. 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[__builtin_alloca (length1 * sizeof(char))] + -1 * ps and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * pt and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * pt and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. 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, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 115 SDslu, 51 SDs, 0 SdLazy, 82 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax107 hnf99 lsp89 ukn85 mio100 lsp40 div100 bol100 ite100 ukn100 eq189 hnf88 smp95 dnf189 smp75 tf100 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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...