./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/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 aca5f83919a6623f93755f2c57c9c6598ba71e3b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:03:44,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:03:44,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:03:44,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:03:44,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:03:44,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:03:44,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:03:44,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:03:44,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:03:44,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:03:44,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:03:44,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:03:44,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:03:44,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:03:44,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:03:44,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:03:44,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:03:44,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:03:44,093 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:03:44,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:03:44,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:03:44,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:03:44,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:03:44,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:03:44,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:03:44,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:03:44,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:03:44,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:03:44,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:03:44,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:03:44,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:03:44,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:03:44,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:03:44,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:03:44,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:03:44,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:03:44,102 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:03:44,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:03:44,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:03:44,113 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:03:44,113 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:03:44,114 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:03:44,114 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:03:44,114 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:03:44,114 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:03:44,114 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:03:44,114 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:03:44,115 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:03:44,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:03:44,115 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:03:44,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:03:44,115 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:03:44,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:03:44,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:03:44,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:03:44,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:03:44,116 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:03:44,117 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:03:44,117 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:03:44,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:03:44,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:03:44,117 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:03:44,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:03:44,118 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:03:44,118 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:03:44,119 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:03:44,119 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_6347fc8d-6c85-4ca3-9555-220766afe745/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 -> aca5f83919a6623f93755f2c57c9c6598ba71e3b [2018-11-28 11:03:44,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:03:44,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:03:44,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:03:44,164 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:03:44,164 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:03:44,165 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-11-28 11:03:44,213 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/data/32c832c1a/14726318facb4bfa8c6a8f4a62feef9e/FLAG61e582f6f [2018-11-28 11:03:44,620 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:03:44,620 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-11-28 11:03:44,628 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/data/32c832c1a/14726318facb4bfa8c6a8f4a62feef9e/FLAG61e582f6f [2018-11-28 11:03:44,996 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/bin-2019/uautomizer/data/32c832c1a/14726318facb4bfa8c6a8f4a62feef9e [2018-11-28 11:03:44,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:03:45,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:03:45,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:03:45,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:03:45,004 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:03:45,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:03:44" (1/1) ... [2018-11-28 11:03:45,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7befda7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45, skipping insertion in model container [2018-11-28 11:03:45,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:03:44" (1/1) ... [2018-11-28 11:03:45,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:03:45,044 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:03:45,264 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:03:45,275 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:03:45,362 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:03:45,392 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:03:45,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45 WrapperNode [2018-11-28 11:03:45,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:03:45,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:03:45,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:03:45,393 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:03:45,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:03:45,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:03:45,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:03:45,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:03:45,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... [2018-11-28 11:03:45,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:03:45,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:03:45,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:03:45,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:03:45,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6347fc8d-6c85-4ca3-9555-220766afe745/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-28 11:03:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:03:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:03:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:03:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:03:45,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:03:45,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:03:45,779 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:03:45,779 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:03:45,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:03:45 BoogieIcfgContainer [2018-11-28 11:03:45,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:03:45,780 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:03:45,780 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:03:45,784 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:03:45,785 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:03:45,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:03:44" (1/3) ... [2018-11-28 11:03:45,787 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f6ec540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:03:45, skipping insertion in model container [2018-11-28 11:03:45,787 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:03:45,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:45" (2/3) ... [2018-11-28 11:03:45,788 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f6ec540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:03:45, skipping insertion in model container [2018-11-28 11:03:45,788 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:03:45,788 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:03:45" (3/3) ... [2018-11-28 11:03:45,790 INFO L375 chiAutomizerObserver]: Analyzing ICFG strspn_true-termination.c.i [2018-11-28 11:03:45,851 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:03:45,851 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:03:45,851 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:03:45,852 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:03:45,852 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:03:45,852 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:03:45,852 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:03:45,852 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:03:45,852 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:03:45,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 11:03:45,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:03:45,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:03:45,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:03:45,898 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:03:45,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:03:45,898 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:03:45,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 11:03:45,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:03:45,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:03:45,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:03:45,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:03:45,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:03:45,910 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 9#L521true assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 6#L525true assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 19#L510-4true [2018-11-28 11:03:45,910 INFO L796 eck$LassoCheckResult]: Loop: 19#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 12#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4#L511-6true assume !true; 5#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 7#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 15#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 19#L510-4true [2018-11-28 11:03:45,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 11:03:45,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:45,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:45,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:45,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:46,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1366197546, now seen corresponding path program 1 times [2018-11-28 11:03:46,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:46,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:46,072 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-28 11:03:46,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:03:46,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:03:46,079 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:03:46,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:03:46,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:03:46,094 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-28 11:03:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:03:46,100 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-28 11:03:46,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:03:46,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-28 11:03:46,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:03:46,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2018-11-28 11:03:46,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 11:03:46,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 11:03:46,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-28 11:03:46,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:03:46,109 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 11:03:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-28 11:03:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 11:03:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 11:03:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 11:03:46,136 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 11:03:46,136 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 11:03:46,136 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:03:46,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-28 11:03:46,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:03:46,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:03:46,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:03:46,138 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:03:46,138 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:03:46,138 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 52#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 48#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 49#L510-4 [2018-11-28 11:03:46,139 INFO L796 eck$LassoCheckResult]: Loop: 49#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 55#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 44#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 45#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 53#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4; 46#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 47#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 50#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 49#L510-4 [2018-11-28 11:03:46,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:46,139 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-28 11:03:46,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:46,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:46,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:46,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:46,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1786909933, now seen corresponding path program 1 times [2018-11-28 11:03:46,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:46,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:03:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:46,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1162005510, now seen corresponding path program 1 times [2018-11-28 11:03:46,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:46,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:46,435 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-28 11:03:46,737 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 11:03:46,820 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:03:46,821 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:03:46,821 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:03:46,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:03:46,821 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:03:46,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:03:46,822 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:03:46,822 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:03:46,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration2_Lasso [2018-11-28 11:03:46,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:03:46,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:03:46,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:46,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:46,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:46,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:46,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:46,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:46,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,096 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-11-28 11:03:47,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:47,531 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:03:47,537 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:03:47,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:47,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:47,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:47,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:47,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:47,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:47,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:47,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:47,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:47,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:47,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:47,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:47,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:47,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:47,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:47,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:47,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:47,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:47,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:03:47,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,567 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:03:47,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:47,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:47,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:47,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:47,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:47,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:47,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:47,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:47,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:47,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:47,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,612 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:03:47,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,614 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:03:47,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:47,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:47,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:47,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:47,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:47,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:47,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:47,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:47,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:47,659 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:03:47,677 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:03:47,677 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:03:47,679 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:03:47,681 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:03:47,681 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:03:47,682 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2018-11-28 11:03:47,771 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 11:03:47,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:03:47,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:47,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:47,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:47,944 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-28 11:03:47,947 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-28 11:03:47,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 11:03:48,024 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 5 states. [2018-11-28 11:03:48,025 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-28 11:03:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:03:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 11:03:48,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-28 11:03:48,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:48,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-28 11:03:48,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:48,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-28 11:03:48,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:48,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-28 11:03:48,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:03:48,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 24 transitions. [2018-11-28 11:03:48,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 11:03:48,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:03:48,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-28 11:03:48,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:03:48,032 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 11:03:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-28 11:03:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 11:03:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 11:03:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-28 11:03:48,034 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 11:03:48,034 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 11:03:48,034 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:03:48,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-28 11:03:48,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:03:48,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:03:48,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:03:48,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:03:48,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:03:48,035 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 189#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 185#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 186#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 193#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 179#L511-6 [2018-11-28 11:03:48,035 INFO L796 eck$LassoCheckResult]: Loop: 179#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 180#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 190#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4; 195#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 179#L511-6 [2018-11-28 11:03:48,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-11-28 11:03:48,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:48,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:48,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:48,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 1 times [2018-11-28 11:03:48,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:48,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:48,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:48,061 INFO L82 PathProgramCache]: Analyzing trace with hash 736220242, now seen corresponding path program 1 times [2018-11-28 11:03:48,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:48,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:48,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:48,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:48,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:48,512 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-11-28 11:03:48,596 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:03:48,596 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:03:48,596 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:03:48,596 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:03:48,596 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:03:48,597 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:03:48,597 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:03:48,597 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:03:48,597 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration3_Lasso [2018-11-28 11:03:48,597 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:03:48,597 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:03:48,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,806 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-11-28 11:03:48,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:48,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:49,186 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:03:49,186 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:03:49,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:49,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:49,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:49,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:49,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:49,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:49,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:49,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:49,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:49,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-28 11:03:49,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:49,191 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:03:49,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:49,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:49,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:03:49,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:49,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:49,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-28 11:03:49,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:49,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:49,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:49,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:49,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:49,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:49,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:49,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-28 11:03:49,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:49,203 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:03:49,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:49,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:49,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:03:49,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:49,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:49,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:49,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:49,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:49,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:49,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:49,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:49,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:49,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:49,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-28 11:03:49,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:49,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:49,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:49,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:49,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:49,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:49,244 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:03:49,258 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 11:03:49,259 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 11:03:49,259 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:03:49,260 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:03:49,260 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:03:49,260 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2 Supporting invariants [] [2018-11-28 11:03:49,314 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 11:03:49,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:03:49,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:49,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:49,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:49,378 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-28 11:03:49,378 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-28 11:03:49,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 11:03:49,419 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 6 states. [2018-11-28 11:03:49,420 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-28 11:03:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:03:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 11:03:49,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 11:03:49,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:49,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 11:03:49,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:49,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 11:03:49,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:49,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-28 11:03:49,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:03:49,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 40 transitions. [2018-11-28 11:03:49,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:03:49,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:03:49,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-11-28 11:03:49,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:03:49,425 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-28 11:03:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-11-28 11:03:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-28 11:03:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 11:03:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-28 11:03:49,428 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 11:03:49,428 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 11:03:49,428 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:03:49,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-28 11:03:49,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:03:49,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:03:49,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:03:49,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:03:49,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:03:49,430 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 378#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 379#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 375#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 376#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 385#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 386#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 381#L511-1 assume !strspn_#t~short7; 382#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4; 373#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 374#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 377#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 388#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 384#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 369#L511-6 [2018-11-28 11:03:49,430 INFO L796 eck$LassoCheckResult]: Loop: 369#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 370#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 380#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4; 387#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 369#L511-6 [2018-11-28 11:03:49,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1779209729, now seen corresponding path program 1 times [2018-11-28 11:03:49,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:49,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:49,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:49,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:49,485 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-28 11:03:49,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:03:49,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:03:49,486 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:03:49,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 2 times [2018-11-28 11:03:49,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:49,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:03:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:03:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:03:49,575 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 11:03:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:03:49,602 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-28 11:03:49,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:03:49,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-28 11:03:49,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:03:49,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 38 transitions. [2018-11-28 11:03:49,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 11:03:49,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:03:49,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2018-11-28 11:03:49,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:03:49,604 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-28 11:03:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2018-11-28 11:03:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-28 11:03:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 11:03:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-28 11:03:49,606 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 11:03:49,606 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 11:03:49,606 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:03:49,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-28 11:03:49,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:03:49,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:03:49,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:03:49,608 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:03:49,608 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:03:49,608 INFO L794 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 450#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 446#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 447#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 456#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 457#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 465#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 462#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4; 444#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 445#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 448#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 460#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 455#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 440#L511-6 [2018-11-28 11:03:49,609 INFO L796 eck$LassoCheckResult]: Loop: 440#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 441#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 451#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4; 458#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 440#L511-6 [2018-11-28 11:03:49,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:49,609 INFO L82 PathProgramCache]: Analyzing trace with hash 4202367, now seen corresponding path program 2 times [2018-11-28 11:03:49,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:49,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:49,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:03:49,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:49,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 3 times [2018-11-28 11:03:49,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:03:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:49,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1675488540, now seen corresponding path program 1 times [2018-11-28 11:03:49,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:03:49,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:03:49,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:03:49,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:03:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:03:50,229 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 130 [2018-11-28 11:03:50,336 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-28 11:03:50,338 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:03:50,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:03:50,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:03:50,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:03:50,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:03:50,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:03:50,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:03:50,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:03:50,339 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration5_Lasso [2018-11-28 11:03:50,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:03:50,339 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:03:50,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,644 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-28 11:03:50,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:50,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:03:51,113 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:03:51,114 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:03:51,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:51,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:51,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:51,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:51,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:03:51,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:51,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:03:51,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:03:51,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:51,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:51,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:51,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,125 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:03:51,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:03:51,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:51,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:51,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:51,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:51,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,135 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:03:51,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,137 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:03:51,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:51,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,143 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-28 11:03:51,143 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 11:03:51,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,155 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-11-28 11:03:51,155 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 11:03:51,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:51,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:51,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:51,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:51,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:51,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:51,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:51,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:51,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:51,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:03:51,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:03:51,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:03:51,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:03:51,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:03:51,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:03:51,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:03:51,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:03:51,228 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:03:51,243 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:03:51,243 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:03:51,244 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:03:51,244 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:03:51,245 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:03:51,245 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-11-28 11:03:51,330 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2018-11-28 11:03:51,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:03:51,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:51,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:51,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:51,410 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-28 11:03:51,410 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-28 11:03:51,411 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 11:03:51,467 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2018-11-28 11:03:51,470 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-28 11:03:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:03:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 11:03:51,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 11:03:51,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:51,471 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:03:51,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:51,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:51,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:51,544 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-28 11:03:51,545 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-28 11:03:51,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 11:03:51,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2018-11-28 11:03:51,590 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-28 11:03:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:03:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 11:03:51,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 11:03:51,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:51,591 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:03:51,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:03:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:51,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:03:51,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:03:51,665 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-28 11:03:51,665 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-28 11:03:51,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 11:03:51,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 57 transitions. Complement of second has 5 states. [2018-11-28 11:03:51,703 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-28 11:03:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:03:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-28 11:03:51,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 11:03:51,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:51,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-28 11:03:51,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:51,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-28 11:03:51,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:03:51,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-11-28 11:03:51,708 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:03:51,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2018-11-28 11:03:51,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:03:51,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:03:51,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:03:51,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:03:51,713 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:03:51,713 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:03:51,713 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:03:51,713 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:03:51,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:03:51,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:03:51,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:03:51,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:03:51 BoogieIcfgContainer [2018-11-28 11:03:51,719 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:03:51,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:03:51,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:03:51,720 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:03:51,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:03:45" (3/4) ... [2018-11-28 11:03:51,724 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:03:51,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:03:51,725 INFO L168 Benchmark]: Toolchain (without parser) took 6725.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.1 MB). Free memory was 950.0 MB in the beginning and 888.0 MB in the end (delta: 61.9 MB). Peak memory consumption was 399.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:03:51,726 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:03:51,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:03:51,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.43 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-28 11:03:51,727 INFO L168 Benchmark]: Boogie Preprocessor took 21.26 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-28 11:03:51,728 INFO L168 Benchmark]: RCFGBuilder took 324.67 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:03:51,728 INFO L168 Benchmark]: BuchiAutomizer took 5938.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 888.0 MB in the end (delta: 217.3 MB). Peak memory consumption was 407.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:03:51,729 INFO L168 Benchmark]: Witness Printer took 4.75 ms. Allocated memory is still 1.4 GB. Free memory is still 888.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:03:51,732 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.26 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 324.67 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5938.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 888.0 MB in the end (delta: 217.3 MB). Peak memory consumption was 407.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.75 ms. Allocated memory is still 1.4 GB. Free memory is still 888.0 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 (in_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * a 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 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 100 SDtfs, 125 SDslu, 46 SDs, 0 SdLazy, 80 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax100 hnf99 lsp95 ukn80 mio100 lsp39 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 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...