./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strspn_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.24-91b1670 [2018-11-28 23:18:13,079 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:13,082 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:13,094 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:13,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:13,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:13,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:13,099 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:13,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:13,102 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:13,103 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:13,104 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:13,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:13,107 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:13,108 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:13,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:13,110 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:13,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:13,115 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:13,117 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:13,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:13,120 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:13,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:13,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:13,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:13,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:13,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:13,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:13,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:13,131 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:13,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:13,132 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:13,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:13,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:13,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:13,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:13,136 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:13,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:13,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:13,155 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:13,156 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:13,156 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:13,157 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:13,157 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:13,157 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:13,157 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:13,158 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:13,158 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:13,158 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:13,158 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:13,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:13,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:13,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:13,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:13,161 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:13,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:13,161 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:13,161 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:13,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:13,163 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:13,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:13,163 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:13,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:13,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:13,164 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:13,165 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:13,166 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aca5f83919a6623f93755f2c57c9c6598ba71e3b [2018-11-28 23:18:13,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:13,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:13,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:13,244 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:13,245 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:13,245 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strspn_true-termination.c.i [2018-11-28 23:18:13,315 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1489a560/c5bb721de553494a8aafad3040c57104/FLAG4d7aa5b4e [2018-11-28 23:18:13,879 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:13,881 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strspn_true-termination.c.i [2018-11-28 23:18:13,900 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1489a560/c5bb721de553494a8aafad3040c57104/FLAG4d7aa5b4e [2018-11-28 23:18:14,125 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1489a560/c5bb721de553494a8aafad3040c57104 [2018-11-28 23:18:14,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:14,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:14,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:14,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:14,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:14,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b83eb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14, skipping insertion in model container [2018-11-28 23:18:14,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:14,202 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:14,535 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:14,548 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:14,622 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:14,675 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:14,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14 WrapperNode [2018-11-28 23:18:14,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:14,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:14,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:14,677 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:14,688 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:18:14" (1/1) ... [2018-11-28 23:18:14,780 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:18:14" (1/1) ... [2018-11-28 23:18:14,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:14,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:14,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:14,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:14,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (1/1) ... [2018-11-28 23:18:14,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:14,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:14,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:14,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:14,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:14,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:15,315 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:15,315 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:18:15,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:15 BoogieIcfgContainer [2018-11-28 23:18:15,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:15,316 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:15,316 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:15,321 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:15,322 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:15,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:14" (1/3) ... [2018-11-28 23:18:15,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@488086bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:15, skipping insertion in model container [2018-11-28 23:18:15,323 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:15,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:14" (2/3) ... [2018-11-28 23:18:15,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@488086bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:15, skipping insertion in model container [2018-11-28 23:18:15,324 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:15,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:15" (3/3) ... [2018-11-28 23:18:15,328 INFO L375 chiAutomizerObserver]: Analyzing ICFG strspn_true-termination.c.i [2018-11-28 23:18:15,391 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:15,392 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:15,392 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:15,392 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:15,392 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:15,393 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:15,393 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:15,393 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:15,393 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:15,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:18:15,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:18:15,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:15,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:15,438 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:15,438 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:15,438 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:15,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:18:15,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:18:15,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:15,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:15,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:15,441 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:15,449 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 23:18:15,449 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 23:18:15,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 23:18:15,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:15,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:15,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:15,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:15,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1366197546, now seen corresponding path program 1 times [2018-11-28 23:18:15,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:15,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:15,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:15,674 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 23:18:15,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:15,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:18:15,682 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:18:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:18:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:18:15,702 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-28 23:18:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:15,710 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-28 23:18:15,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:18:15,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-28 23:18:15,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:18:15,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2018-11-28 23:18:15,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:18:15,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:18:15,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-28 23:18:15,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:15,722 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:18:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-28 23:18:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 23:18:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:18:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 23:18:15,753 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:18:15,753 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:18:15,754 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:15,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-28 23:18:15,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:18:15,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:15,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:15,755 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:15,756 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:15,756 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 23:18:15,756 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~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 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 23:18:15,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-28 23:18:15,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:15,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1786909933, now seen corresponding path program 1 times [2018-11-28 23:18:15,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:15,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1162005510, now seen corresponding path program 1 times [2018-11-28 23:18:15,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:15,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:15,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:15,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:16,452 WARN L180 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-28 23:18:16,591 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:18:17,358 WARN L180 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 23:18:17,471 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-28 23:18:17,484 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:17,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:17,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:17,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:17,486 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:17,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:17,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:17,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:17,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:18:17,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:17,487 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:17,513 INFO 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 23:18:17,537 INFO 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 23:18:17,543 INFO 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 23:18:17,546 INFO 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 23:18:17,556 INFO 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 23:18:17,565 INFO 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 23:18:17,574 INFO 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 23:18:18,025 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-11-28 23:18:18,189 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-11-28 23:18:18,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 23:18:18,192 INFO 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 23:18:18,195 INFO 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 23:18:18,199 INFO 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 23:18:18,200 INFO 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 23:18:18,203 INFO 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 23:18:18,205 INFO 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 23:18:18,206 INFO 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 23:18:18,209 INFO 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 23:18:18,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:18,216 INFO 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 23:18:18,218 INFO 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 23:18:18,222 INFO 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 23:18:18,835 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 23:18:18,909 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:18,915 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:18,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:18,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:18,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,949 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:18,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,950 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:18,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:18,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:18,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:18,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:18,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:18,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:18,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:19,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:19,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:19,004 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:19,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:19,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:19,008 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:19,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:19,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:19,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:19,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:19,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:19,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:19,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:19,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,125 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:19,152 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:18:19,152 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:19,156 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:19,157 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:19,157 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:19,158 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 23:18:19,401 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:18:19,442 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:19,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,788 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 23:18:19,793 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 23:18:19,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:18:19,887 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 23:18:19,889 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 23:18:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:18:19,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-28 23:18:19,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:19,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-28 23:18:19,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:19,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-28 23:18:19,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:19,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-28 23:18:19,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:19,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 24 transitions. [2018-11-28 23:18:19,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:18:19,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:18:19,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-28 23:18:19,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:19,899 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 23:18:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-28 23:18:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 23:18:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:18:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-28 23:18:19,903 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 23:18:19,903 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 23:18:19,903 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:19,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-28 23:18:19,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:19,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:19,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:19,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:19,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:19,905 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 23:18:19,907 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~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 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 23:18:19,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-11-28 23:18:19,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:19,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:19,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:19,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:19,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 1 times [2018-11-28 23:18:19,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:19,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:19,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash 736220242, now seen corresponding path program 1 times [2018-11-28 23:18:19,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:19,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:19,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:20,156 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-11-28 23:18:20,653 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-11-28 23:18:20,786 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-28 23:18:20,789 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:20,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:20,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:20,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:20,789 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:20,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:20,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:20,790 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:20,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:18:20,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:20,790 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:20,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:20,829 INFO 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 23:18:21,236 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-11-28 23:18:21,414 INFO 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 23:18:21,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,457 INFO 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 23:18:21,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:21,462 INFO 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 23:18:22,308 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:22,308 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:22,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:22,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:22,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:22,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:22,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:22,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:22,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:22,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:22,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:22,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:22,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:22,315 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:22,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:22,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:22,320 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:22,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:22,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:22,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:22,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:22,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:22,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:22,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:22,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:22,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:22,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:22,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:22,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:22,339 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:22,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:22,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:22,344 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:22,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:22,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:22,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:22,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:22,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:22,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:22,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:22,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:22,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:22,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:22,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:22,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:22,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:22,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:22,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:22,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:22,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:22,404 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:22,438 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:18:22,439 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:18:22,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:22,442 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:22,443 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:22,443 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-11-28 23:18:22,761 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 23:18:22,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:22,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:22,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:22,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:22,961 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 23:18:22,962 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 23:18:22,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 23:18:23,023 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 23:18:23,024 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 23:18:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:18:23,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:18:23,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:23,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:18:23,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:23,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 23:18:23,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:23,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-28 23:18:23,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:23,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 40 transitions. [2018-11-28 23:18:23,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:18:23,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:18:23,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-11-28 23:18:23,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:23,030 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-28 23:18:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-11-28 23:18:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-28 23:18:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:18:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-28 23:18:23,034 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 23:18:23,034 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 23:18:23,034 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:23,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-28 23:18:23,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:23,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:23,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:23,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:23,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:23,039 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~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 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 23:18:23,039 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~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 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 23:18:23,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1779209729, now seen corresponding path program 1 times [2018-11-28 23:18:23,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:23,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:23,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:23,105 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 23:18:23,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:23,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:18:23,106 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:18:23,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 2 times [2018-11-28 23:18:23,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:23,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:23,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:23,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:23,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:23,858 WARN L180 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-11-28 23:18:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:18:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:18:23,887 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:18:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:23,945 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-28 23:18:23,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:18:23,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-28 23:18:23,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:23,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 38 transitions. [2018-11-28 23:18:23,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:18:23,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:18:23,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2018-11-28 23:18:23,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:23,950 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-28 23:18:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2018-11-28 23:18:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-28 23:18:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:18:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-28 23:18:23,954 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 23:18:23,954 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 23:18:23,954 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:18:23,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-28 23:18:23,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:18:23,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:23,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:23,958 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:23,958 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:23,958 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~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 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 23:18:23,959 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~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 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 23:18:23,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:23,959 INFO L82 PathProgramCache]: Analyzing trace with hash 4202367, now seen corresponding path program 2 times [2018-11-28 23:18:23,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:23,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:23,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:23,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:23,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 3 times [2018-11-28 23:18:23,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:23,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:23,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:23,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:23,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:24,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1675488540, now seen corresponding path program 1 times [2018-11-28 23:18:24,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:24,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:24,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:24,355 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-11-28 23:18:24,993 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 130 [2018-11-28 23:18:25,134 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-28 23:18:25,138 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:25,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:25,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:25,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:25,139 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:25,139 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:25,139 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:25,139 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:25,139 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:18:25,139 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:25,139 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:25,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:25,147 INFO 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 23:18:25,149 INFO 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 23:18:25,968 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-28 23:18:26,129 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2018-11-28 23:18:26,130 INFO 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 23:18:26,136 INFO 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 23:18:26,138 INFO 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 23:18:26,140 INFO 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 23:18:26,142 INFO 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 23:18:26,144 INFO 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 23:18:26,146 INFO 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 23:18:26,148 INFO 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 23:18:26,151 INFO 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 23:18:26,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,157 INFO 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 23:18:26,159 INFO 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 23:18:26,161 INFO 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 23:18:26,163 INFO 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 23:18:26,166 INFO 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 23:18:26,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 23:18:26,851 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:26,853 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:26,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:26,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:26,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:26,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:26,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:26,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:26,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:26,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:26,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:26,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:26,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:26,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,879 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:26,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,884 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:26,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:26,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:26,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:26,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:26,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,899 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:26,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,904 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:26,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:26,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,915 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-28 23:18:26,915 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 23:18:26,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,929 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-11-28 23:18:26,929 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 23:18:26,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:26,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:26,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:26,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:26,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:26,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:26,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:26,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:26,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:26,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:26,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:26,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:26,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:26,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:27,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:27,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:18:27,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:27,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:27,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:27,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:27,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:27,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:27,033 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:27,065 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:18:27,066 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:27,066 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:27,069 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:27,069 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:27,070 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 23:18:27,909 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2018-11-28 23:18:27,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:28,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:28,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:28,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:28,553 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 23:18:28,553 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 23:18:28,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 23:18:28,640 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 23:18:28,647 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 23:18:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:18:28,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:18:28,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:28,648 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:28,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:28,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:28,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:28,746 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 23:18:28,747 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 23:18:28,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 23:18:28,816 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 23:18:28,821 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 23:18:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:18:28,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:18:28,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:28,822 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:28,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:28,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:28,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:28,933 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 23:18:28,933 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 23:18:28,934 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 23:18:28,987 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 23:18:28,989 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 23:18:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-28 23:18:28,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:18:28,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:28,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-28 23:18:28,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:28,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-28 23:18:28,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:28,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-11-28 23:18:28,997 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:28,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2018-11-28 23:18:28,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:28,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:28,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:28,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:28,997 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:28,998 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:29,000 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:29,000 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:18:29,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:29,000 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:29,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:29,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:29 BoogieIcfgContainer [2018-11-28 23:18:29,008 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:29,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:29,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:29,009 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:29,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:15" (3/4) ... [2018-11-28 23:18:29,014 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:29,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:29,016 INFO L168 Benchmark]: Toolchain (without parser) took 14886.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 947.3 MB in the beginning and 857.2 MB in the end (delta: 90.1 MB). Peak memory consumption was 404.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,017 INFO L168 Benchmark]: CDTParser took 3.40 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:29,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.24 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 920.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,021 INFO L168 Benchmark]: Boogie Preprocessor took 36.39 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 23:18:29,022 INFO L168 Benchmark]: RCFGBuilder took 472.39 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,022 INFO L168 Benchmark]: BuchiAutomizer took 13691.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 857.2 MB in the end (delta: 242.9 MB). Peak memory consumption was 425.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,023 INFO L168 Benchmark]: Witness Printer took 6.52 ms. Allocated memory is still 1.3 GB. Free memory is still 857.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:29,031 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.40 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 543.24 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 920.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.39 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 472.39 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13691.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 857.2 MB in the end (delta: 242.9 MB). Peak memory consumption was 425.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.52 ms. Allocated memory is still 1.3 GB. Free memory is still 857.2 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 unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * a 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 13.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.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.1s 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: 63ms 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...