./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eaca3e09b762fe94634aa0b3e6a04213782212a5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:53:48,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:53:48,269 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:53:48,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:53:48,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:53:48,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:53:48,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:53:48,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:53:48,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:53:48,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:53:48,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:53:48,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:53:48,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:53:48,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:53:48,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:53:48,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:53:48,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:53:48,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:53:48,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:53:48,294 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:53:48,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:53:48,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:53:48,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:53:48,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:53:48,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:53:48,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:53:48,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:53:48,316 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:53:48,317 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:53:48,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:53:48,318 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:53:48,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:53:48,319 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:53:48,319 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:53:48,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:53:48,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:53:48,328 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:53:48,339 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:53:48,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:53:48,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:53:48,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:53:48,353 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:53:48,353 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:53:48,353 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:53:48,354 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:53:48,354 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:53:48,354 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:53:48,354 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:53:48,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:53:48,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:53:48,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:53:48,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:53:48,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:53:48,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:53:48,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:53:48,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:53:48,355 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:53:48,355 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:53:48,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:53:48,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:53:48,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:53:48,356 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:53:48,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:53:48,364 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:53:48,364 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:53:48,365 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:53:48,365 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eaca3e09b762fe94634aa0b3e6a04213782212a5 [2018-11-18 12:53:48,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:53:48,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:53:48,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:53:48,441 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:53:48,442 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:53:48,442 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-18 12:53:48,534 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/data/6c7c468e3/bf0796270c654c82a4620af45533d8d0/FLAG939f49e10 [2018-11-18 12:53:49,002 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:53:49,002 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-18 12:53:49,014 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/data/6c7c468e3/bf0796270c654c82a4620af45533d8d0/FLAG939f49e10 [2018-11-18 12:53:49,358 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/data/6c7c468e3/bf0796270c654c82a4620af45533d8d0 [2018-11-18 12:53:49,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:53:49,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:53:49,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:53:49,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:53:49,366 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:53:49,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a4c700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49, skipping insertion in model container [2018-11-18 12:53:49,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:53:49,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:53:49,655 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:53:49,661 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:53:49,694 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:53:49,791 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:53:49,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49 WrapperNode [2018-11-18 12:53:49,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:53:49,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:53:49,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:53:49,792 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:53:49,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:53:49,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:53:49,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:53:49,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:53:49,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... [2018-11-18 12:53:49,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:53:49,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:53:49,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:53:49,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:53:49,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:53:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:53:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:53:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:53:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:53:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:53:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:53:50,113 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:53:50,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:53:50 BoogieIcfgContainer [2018-11-18 12:53:50,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:53:50,115 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:53:50,115 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:53:50,117 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:53:50,117 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:53:50,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:53:49" (1/3) ... [2018-11-18 12:53:50,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cb43140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:53:50, skipping insertion in model container [2018-11-18 12:53:50,119 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:53:50,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:53:49" (2/3) ... [2018-11-18 12:53:50,119 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cb43140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:53:50, skipping insertion in model container [2018-11-18 12:53:50,119 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:53:50,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:53:50" (3/3) ... [2018-11-18 12:53:50,121 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcspn_true-termination.c.i [2018-11-18 12:53:50,160 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:53:50,160 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:53:50,160 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:53:50,161 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:53:50,161 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:53:50,161 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:53:50,161 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:53:50,162 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:53:50,162 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:53:50,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 12:53:50,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:53:50,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:53:50,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:53:50,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:53:50,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:53:50,195 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:53:50,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 12:53:50,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:53:50,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:53:50,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:53:50,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:53:50,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:53:50,203 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 12#L519true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L523true assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 18#L510-4true [2018-11-18 12:53:50,203 INFO L796 eck$LassoCheckResult]: Loop: 18#L510-4true assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 11#L510-1true assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 15#L511-4true assume !true; 19#L511-5true strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 16#L510-3true strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 18#L510-4true [2018-11-18 12:53:50,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:50,208 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-18 12:53:50,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:50,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:50,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:50,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash 44069891, now seen corresponding path program 1 times [2018-11-18 12:53:50,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:50,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:50,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:50,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:50,333 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-18 12:53:50,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:53:50,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:53:50,337 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:53:50,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:53:50,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:53:50,349 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-18 12:53:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:53:50,354 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-18 12:53:50,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:53:50,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-18 12:53:50,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:53:50,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 13 transitions. [2018-11-18 12:53:50,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 12:53:50,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 12:53:50,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-18 12:53:50,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:53:50,362 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 12:53:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-18 12:53:50,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 12:53:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 12:53:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 12:53:50,385 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 12:53:50,385 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 12:53:50,385 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:53:50,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-18 12:53:50,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:53:50,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:53:50,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:53:50,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:53:50,387 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:53:50,387 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 43#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 50#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 53#L510-4 [2018-11-18 12:53:50,387 INFO L796 eck$LassoCheckResult]: Loop: 53#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 48#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 49#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 44#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 45#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 52#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 53#L510-4 [2018-11-18 12:53:50,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-18 12:53:50,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:50,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:50,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:50,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:50,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:50,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1365737035, now seen corresponding path program 1 times [2018-11-18 12:53:50,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:50,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:50,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:50,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:50,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:50,427 INFO L82 PathProgramCache]: Analyzing trace with hash 736220402, now seen corresponding path program 1 times [2018-11-18 12:53:50,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:50,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:51,070 WARN L180 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-11-18 12:53:51,196 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-18 12:53:51,206 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:53:51,207 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:53:51,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:53:51,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:53:51,208 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:53:51,208 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:53:51,208 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:53:51,208 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:53:51,208 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration2_Lasso [2018-11-18 12:53:51,209 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:53:51,209 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:53:51,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,573 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-18 12:53:51,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:51,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:52,230 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:53:52,233 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:53:52,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:52,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:52,237 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:53:52,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:52,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:52,243 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:53:52,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:52,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:52,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:52,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:52,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:52,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:52,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:52,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:52,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:52,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:52,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:52,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:52,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:52,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:52,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:52,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:52,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:52,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:52,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:52,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:52,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:52,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:52,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:52,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:52,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:52,312 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:53:52,338 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:53:52,339 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:53:52,341 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:53:52,342 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:53:52,342 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:53:52,343 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1, ULTIMATE.start_strcspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1 - 1*ULTIMATE.start_strcspn_~s.offset Supporting invariants [] [2018-11-18 12:53:52,433 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 12:53:52,438 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:53:52,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:52,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:52,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:52,514 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-18 12:53:52,516 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:53:52,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-18 12:53:52,569 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 20 states and 23 transitions. Complement of second has 4 states. [2018-11-18 12:53:52,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 12:53:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:53:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-18 12:53:52,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-18 12:53:52,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:52,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-18 12:53:52,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:52,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-18 12:53:52,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:52,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-18 12:53:52,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:53:52,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 21 transitions. [2018-11-18 12:53:52,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 12:53:52,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 12:53:52,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-18 12:53:52,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:53:52,575 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 12:53:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-18 12:53:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 12:53:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 12:53:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-18 12:53:52,576 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 12:53:52,576 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 12:53:52,577 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:53:52,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-18 12:53:52,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:53:52,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:53:52,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:53:52,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:53:52,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:53:52,578 INFO L794 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 185#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 196#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 199#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 192#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 193#L511-4 [2018-11-18 12:53:52,578 INFO L796 eck$LassoCheckResult]: Loop: 193#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 186#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 187#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 197#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 193#L511-4 [2018-11-18 12:53:52,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-11-18 12:53:52,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:52,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:52,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:52,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 1 times [2018-11-18 12:53:52,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:52,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:52,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:52,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash 736222132, now seen corresponding path program 1 times [2018-11-18 12:53:52,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:52,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:52,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:53,014 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2018-11-18 12:53:53,164 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-11-18 12:53:53,167 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:53:53,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:53:53,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:53:53,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:53:53,167 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:53:53,167 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:53:53,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:53:53,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:53:53,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration3_Lasso [2018-11-18 12:53:53,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:53:53,167 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:53:53,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,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-18 12:53:53,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,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-18 12:53:53,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,475 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-18 12:53:53,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:53,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:53:53,833 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:53:53,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:53,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:53,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:53,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:53,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:53,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:53,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:53,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:53,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:53,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:53,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:53,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:53,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:53,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:53,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:53,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:53,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:53,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:53,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:53,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:53,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:53,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:53,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:53,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:53,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:53,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:53,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:53,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,860 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:53:53,860 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 12:53:53,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,869 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-18 12:53:53,869 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 12:53:53,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:53,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:53,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:53,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:53,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:53,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:53,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:53,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:53,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:53,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:53,934 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:53:53,947 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:53:53,947 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:53:53,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:53:53,949 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:53:53,949 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:53:53,949 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~reject.offset, ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2) = -1*ULTIMATE.start_strcspn_~reject.offset - 1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2 Supporting invariants [] [2018-11-18 12:53:54,030 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-18 12:53:54,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:53:54,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:54,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:54,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:54,078 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-18 12:53:54,079 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:53:54,079 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 12:53:54,100 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 45 states and 51 transitions. Complement of second has 5 states. [2018-11-18 12:53:54,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 12:53:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:53:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-18 12:53:54,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 12:53:54,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:54,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 12:53:54,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:54,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 12:53:54,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:54,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2018-11-18 12:53:54,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:53:54,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 33 transitions. [2018-11-18 12:53:54,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:53:54,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:53:54,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-18 12:53:54,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:53:54,104 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 12:53:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-18 12:53:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-18 12:53:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 12:53:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-18 12:53:54,106 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 12:53:54,106 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 12:53:54,106 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:53:54,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-18 12:53:54,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:53:54,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:53:54,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:53:54,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:53:54,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:53:54,108 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 363#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 373#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 379#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 382#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 384#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 383#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 381#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 377#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 378#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 369#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 370#L511-4 [2018-11-18 12:53:54,108 INFO L796 eck$LassoCheckResult]: Loop: 370#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 364#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 365#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 374#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 370#L511-4 [2018-11-18 12:53:54,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:54,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1161797001, now seen corresponding path program 2 times [2018-11-18 12:53:54,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:54,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:54,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:54,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:54,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:54,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 2 times [2018-11-18 12:53:54,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:54,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:54,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:54,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:54,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:54,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash -967302850, now seen corresponding path program 1 times [2018-11-18 12:53:54,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:54,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:54,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:54,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:54,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:54,452 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-11-18 12:53:54,682 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2018-11-18 12:53:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:53:54,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:53:54,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9384dca-a5df-42d7-a257-097b93537b6c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:53:54,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:54,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:54,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 12:53:54,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 12:53:54,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:53:54,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:53:54,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:53:54,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 12:53:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:53:55,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:53:55,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-18 12:53:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:53:55,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:53:55,094 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 13 states. [2018-11-18 12:53:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:53:55,155 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-18 12:53:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:53:55,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2018-11-18 12:53:55,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:53:55,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 39 transitions. [2018-11-18 12:53:55,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:53:55,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:53:55,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2018-11-18 12:53:55,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:53:55,157 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-18 12:53:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2018-11-18 12:53:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-18 12:53:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 12:53:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-18 12:53:55,159 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 12:53:55,159 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 12:53:55,159 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:53:55,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-18 12:53:55,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:53:55,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:53:55,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:53:55,161 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:53:55,161 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:53:55,161 INFO L794 eck$LassoCheckResult]: Stem: 505#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 499#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 500#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 510#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 514#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 518#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 515#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 503#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 504#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 512#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 513#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 520#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 519#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 516#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 517#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 506#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 507#L511-4 [2018-11-18 12:53:55,161 INFO L796 eck$LassoCheckResult]: Loop: 507#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 501#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 502#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 511#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 507#L511-4 [2018-11-18 12:53:55,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1375356158, now seen corresponding path program 2 times [2018-11-18 12:53:55,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:55,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:53:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:55,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:55,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 3 times [2018-11-18 12:53:55,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:55,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:55,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:55,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:55,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1858115515, now seen corresponding path program 3 times [2018-11-18 12:53:55,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:55,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:55,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:55,592 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 136 [2018-11-18 12:53:55,678 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:53:55,679 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:53:55,679 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:53:55,679 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:53:55,679 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:53:55,679 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:53:55,679 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:53:55,679 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:53:55,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration5_Lasso [2018-11-18 12:53:55,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:53:55,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:53:55,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:55,979 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-11-18 12:53:56,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:56,382 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-18 12:53:56,476 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:53:56,476 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:53:56,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:56,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:56,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:56,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:56,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:56,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:56,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:56,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:56,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:53:56,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:53:56,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:53:56,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:56,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:56,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:56,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:56,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,517 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:53:56,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,518 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:53:56,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:56,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,524 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-18 12:53:56,524 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 12:53:56,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,537 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-11-18 12:53:56,537 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 12:53:56,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:56,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:56,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:56,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:56,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:56,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:56,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:56,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:56,638 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:53:56,676 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:53:56,676 INFO L444 ModelExtractionUtils]: 41 out of 49 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 12:53:56,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:53:56,677 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:53:56,678 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:53:56,678 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3) = -2*ULTIMATE.start_strcspn_~i~0 + 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 Supporting invariants [] [2018-11-18 12:53:56,801 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-11-18 12:53:56,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:53:56,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:56,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:56,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:53:56,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:53:56,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-18 12:53:56,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2018-11-18 12:53:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-18 12:53:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 12:53:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-18 12:53:56,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 12:53:56,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:56,953 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:53:56,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:56,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:57,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:57,077 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-18 12:53:57,077 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:53:57,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-18 12:53:57,100 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2018-11-18 12:53:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-18 12:53:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 12:53:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-18 12:53:57,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 12:53:57,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:57,101 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:53:57,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:57,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:57,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:57,184 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-18 12:53:57,185 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:53:57,185 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-18 12:53:57,247 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 56 states and 63 transitions. Complement of second has 11 states. [2018-11-18 12:53:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:53:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 12:53:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-18 12:53:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 12:53:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:57,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 12:53:57,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:57,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 12:53:57,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:57,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2018-11-18 12:53:57,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:53:57,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 46 transitions. [2018-11-18 12:53:57,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:53:57,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 12:53:57,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-11-18 12:53:57,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:53:57,251 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-18 12:53:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-11-18 12:53:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-11-18 12:53:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 12:53:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 12:53:57,253 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 12:53:57,253 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 12:53:57,253 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:53:57,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-11-18 12:53:57,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:53:57,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:53:57,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:53:57,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 12:53:57,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:53:57,255 INFO L794 eck$LassoCheckResult]: Stem: 1036#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1030#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 1031#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1041#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 1047#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1052#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1061#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1058#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1060#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1059#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1057#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1056#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1055#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1045#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1046#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1053#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1066#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1065#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1048#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1049#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1064#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1062#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1050#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1051#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1054#L510-4 assume true;call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1037#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1038#L511-4 [2018-11-18 12:53:57,255 INFO L796 eck$LassoCheckResult]: Loop: 1038#L511-4 assume true;call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1032#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1033#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1042#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1038#L511-4 [2018-11-18 12:53:57,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1550213327, now seen corresponding path program 4 times [2018-11-18 12:53:57,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:57,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:57,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 4 times [2018-11-18 12:53:57,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:57,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:57,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:57,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash 229061526, now seen corresponding path program 5 times [2018-11-18 12:53:57,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:53:57,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:53:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:57,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:53:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:53:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:57,826 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 169 [2018-11-18 12:53:57,933 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-18 12:53:57,934 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:53:57,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:53:57,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:53:57,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:53:57,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:53:57,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:53:57,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:53:57,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:53:57,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration6_Lasso [2018-11-18 12:53:57,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:53:57,935 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:53:57,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:57,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,263 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-18 12:53:58,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:58,507 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 12:53:59,330 WARN L180 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-11-18 12:53:59,364 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:53:59,364 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:53:59,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:59,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:59,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:59,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:59,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:59,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:59,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:59,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:59,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:59,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:59,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:59,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:59,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:59,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:59,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:59,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:53:59,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:53:59,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:53:59,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:53:59,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:53:59,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:53:59,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:53:59,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:53:59,390 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:53:59,404 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:53:59,404 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:53:59,404 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:53:59,405 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:53:59,405 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:53:59,405 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, ULTIMATE.start_strcspn_~reject.offset, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4) = -1*ULTIMATE.start_strcspn_~i~0 - 1*ULTIMATE.start_strcspn_~reject.offset + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 Supporting invariants [] [2018-11-18 12:53:59,498 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-18 12:53:59,500 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:53:59,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:59,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:59,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:59,537 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-18 12:53:59,537 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:53:59,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-18 12:53:59,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 45 states and 50 transitions. Complement of second has 5 states. [2018-11-18 12:53:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 12:53:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:53:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-18 12:53:59,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-18 12:53:59,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:59,551 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:53:59,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:59,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:59,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:59,588 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-18 12:53:59,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:53:59,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-18 12:53:59,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 45 states and 50 transitions. Complement of second has 5 states. [2018-11-18 12:53:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 12:53:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:53:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-18 12:53:59,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-18 12:53:59,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:59,603 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:53:59,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:53:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:59,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:53:59,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:53:59,655 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-18 12:53:59,655 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:53:59,655 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-18 12:53:59,665 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 62 states and 71 transitions. Complement of second has 4 states. [2018-11-18 12:53:59,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 12:53:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 12:53:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-18 12:53:59,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-18 12:53:59,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:59,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 30 letters. Loop has 4 letters. [2018-11-18 12:53:59,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:59,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 8 letters. [2018-11-18 12:53:59,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:53:59,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2018-11-18 12:53:59,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:53:59,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 0 states and 0 transitions. [2018-11-18 12:53:59,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:53:59,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:53:59,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:53:59,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:53:59,670 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:53:59,670 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:53:59,670 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:53:59,670 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:53:59,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:53:59,670 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:53:59,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:53:59,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:53:59 BoogieIcfgContainer [2018-11-18 12:53:59,674 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:53:59,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:53:59,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:53:59,674 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:53:59,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:53:50" (3/4) ... [2018-11-18 12:53:59,678 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:53:59,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:53:59,679 INFO L168 Benchmark]: Toolchain (without parser) took 10317.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 959.8 MB in the beginning and 1.0 GB in the end (delta: -48.7 MB). Peak memory consumption was 326.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:53:59,680 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:53:59,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:53:59,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:53:59,681 INFO L168 Benchmark]: Boogie Preprocessor took 19.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:53:59,681 INFO L168 Benchmark]: RCFGBuilder took 271.84 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:53:59,682 INFO L168 Benchmark]: BuchiAutomizer took 9559.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.2 MB). Peak memory consumption was 330.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:53:59,682 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:53:59,685 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 271.84 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9559.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.2 MB). Peak memory consumption was 330.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function -1 * reject + -1 * i + unknown-#length-unknown[reject] and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i + -1 * reject + unknown-#length-unknown[reject] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.5s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 8.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 193 SDslu, 90 SDs, 0 SdLazy, 125 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital253 mio100 ax100 hnf99 lsp94 ukn78 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf89 smp96 dnf461 smp77 tf100 neg91 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 136 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...