./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash aca5f83919a6623f93755f2c57c9c6598ba71e3b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:46:02,394 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:46:02,395 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:46:02,402 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:46:02,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:46:02,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:46:02,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:46:02,406 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:46:02,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:46:02,408 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:46:02,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:46:02,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:46:02,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:46:02,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:46:02,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:46:02,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:46:02,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:46:02,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:46:02,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:46:02,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:46:02,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:46:02,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:46:02,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:46:02,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:46:02,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:46:02,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:46:02,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:46:02,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:46:02,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:46:02,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:46:02,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:46:02,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:46:02,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:46:02,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:46:02,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:46:02,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:46:02,426 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 04:46:02,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:46:02,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:46:02,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:46:02,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:46:02,439 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:46:02,440 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:46:02,440 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:46:02,440 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:46:02,440 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:46:02,440 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:46:02,440 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:46:02,441 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:46:02,441 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:46:02,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:46:02,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:46:02,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:46:02,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:46:02,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:46:02,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:46:02,442 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:46:02,442 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:46:02,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:46:02,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:46:02,442 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:46:02,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:46:02,443 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:46:02,443 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:46:02,444 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:46:02,444 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_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aca5f83919a6623f93755f2c57c9c6598ba71e3b [2018-11-10 04:46:02,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:46:02,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:46:02,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:46:02,487 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:46:02,487 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:46:02,488 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-11-10 04:46:02,538 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/data/f7d16a863/e21cd8b593ea45e796650b985ba5b3d1/FLAGf6b69dfca [2018-11-10 04:46:02,929 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:46:02,930 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-11-10 04:46:02,939 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/data/f7d16a863/e21cd8b593ea45e796650b985ba5b3d1/FLAGf6b69dfca [2018-11-10 04:46:02,954 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/bin-2019/uautomizer/data/f7d16a863/e21cd8b593ea45e796650b985ba5b3d1 [2018-11-10 04:46:02,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:46:02,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:46:02,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:46:02,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:46:02,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:46:02,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:46:02" (1/1) ... [2018-11-10 04:46:02,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42185193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:02, skipping insertion in model container [2018-11-10 04:46:02,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:46:02" (1/1) ... [2018-11-10 04:46:02,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:46:03,015 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:46:03,248 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:46:03,256 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:46:03,291 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:46:03,319 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:46:03,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03 WrapperNode [2018-11-10 04:46:03,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:46:03,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:46:03,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:46:03,321 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:46:03,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:46:03,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:46:03,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:46:03,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:46:03,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... [2018-11-10 04:46:03,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:46:03,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:46:03,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:46:03,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:46:03,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58a313a0-a9b5-402c-b466-72548bbafde2/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-10 04:46:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:46:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:46:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:46:03,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:46:03,695 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:46:03,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:03 BoogieIcfgContainer [2018-11-10 04:46:03,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:46:03,696 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:46:03,697 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:46:03,699 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:46:03,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:03,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:46:02" (1/3) ... [2018-11-10 04:46:03,701 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ce82ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:46:03, skipping insertion in model container [2018-11-10 04:46:03,701 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:03,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:46:03" (2/3) ... [2018-11-10 04:46:03,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ce82ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:46:03, skipping insertion in model container [2018-11-10 04:46:03,702 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:46:03,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:03" (3/3) ... [2018-11-10 04:46:03,704 INFO L375 chiAutomizerObserver]: Analyzing ICFG strspn_true-termination.c.i [2018-11-10 04:46:03,753 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:46:03,753 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:46:03,754 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:46:03,754 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:46:03,754 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:46:03,754 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:46:03,754 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:46:03,754 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:46:03,754 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:46:03,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 04:46:03,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:46:03,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:03,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:03,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:03,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:03,791 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:46:03,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 04:46:03,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:46:03,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:03,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:03,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:03,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:03,800 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L521true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 20#L523true SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L523 23#L523-1true main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 18#L525true assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 30#L527true SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L527 17#L527-1true assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 3#L510-5true [2018-11-10 04:46:03,801 INFO L795 eck$LassoCheckResult]: Loop: 3#L510-5true assume true; 9#L510-1true SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 11#L510-2true assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 6#L511-11true assume !true; 8#L511-12true SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 21#L512true assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 15#L510-4true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 3#L510-5true [2018-11-10 04:46:03,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:03,805 INFO L82 PathProgramCache]: Analyzing trace with hash 175627178, now seen corresponding path program 1 times [2018-11-10 04:46:03,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:03,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:03,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:03,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1355187460, now seen corresponding path program 1 times [2018-11-10 04:46:03,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:03,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:03,942 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-10 04:46:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:46:03,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:46:03,947 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:46:03,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:46:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:46:03,961 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 04:46:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:03,967 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 04:46:03,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:46:03,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 04:46:03,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:46:03,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 25 transitions. [2018-11-10 04:46:03,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 04:46:03,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 04:46:03,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-10 04:46:03,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:03,974 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 04:46:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-10 04:46:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 04:46:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 04:46:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-10 04:46:04,000 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 04:46:04,001 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 04:46:04,001 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:46:04,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-10 04:46:04,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:46:04,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:04,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:04,003 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:04,003 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:04,003 INFO L793 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 78#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 79#L521 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 73#L523 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L523 74#L523-1 main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 69#L525 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 70#L527 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L527 68#L527-1 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 64#L510-5 [2018-11-10 04:46:04,003 INFO L795 eck$LassoCheckResult]: Loop: 64#L510-5 assume true; 65#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 83#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 77#L511-11 assume true; 80#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 81#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 84#L511-3 assume !strspn_#t~short7; 67#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 71#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 75#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 76#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 64#L510-5 [2018-11-10 04:46:04,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 175627178, now seen corresponding path program 2 times [2018-11-10 04:46:04,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:04,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:04,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1884216373, now seen corresponding path program 1 times [2018-11-10 04:46:04,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:04,127 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-10 04:46:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:46:04,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:46:04,128 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:46:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:46:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:46:04,128 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-10 04:46:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:04,231 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-10 04:46:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:46:04,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2018-11-10 04:46:04,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:46:04,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 27 transitions. [2018-11-10 04:46:04,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 04:46:04,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 04:46:04,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2018-11-10 04:46:04,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:04,234 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-10 04:46:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2018-11-10 04:46:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-10 04:46:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 04:46:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-10 04:46:04,236 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-10 04:46:04,236 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-10 04:46:04,236 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:46:04,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-11-10 04:46:04,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 04:46:04,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:04,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:04,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:04,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:04,238 INFO L793 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 144#L521 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 138#L523 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L523 139#L523-1 main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 134#L525 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 135#L527 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L527 133#L527-1 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 129#L510-5 [2018-11-10 04:46:04,238 INFO L795 eck$LassoCheckResult]: Loop: 129#L510-5 assume true; 130#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 149#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 142#L511-11 assume true; 145#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 146#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 150#L511-3 assume strspn_#t~short7; 151#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 152#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 131#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 132#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 148#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 140#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 141#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 129#L510-5 [2018-11-10 04:46:04,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 175627178, now seen corresponding path program 3 times [2018-11-10 04:46:04,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:04,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:04,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash -843967789, now seen corresponding path program 1 times [2018-11-10 04:46:04,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:04,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:04,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:04,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:04,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1045966148, now seen corresponding path program 1 times [2018-11-10 04:46:04,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:04,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:04,478 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-10 04:46:04,831 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-11-10 04:46:04,939 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:04,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:04,940 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:04,940 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:04,940 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:04,940 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:04,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:04,941 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:04,941 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration3_Lasso [2018-11-10 04:46:04,941 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:04,941 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:04,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:04,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,206 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-10 04:46:05,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,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-10 04:46:05,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-10 04:46:05,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-10 04:46:05,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-10 04:46:05,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-10 04:46:05,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:05,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-10 04:46:05,683 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:05,688 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:05,689 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-10 04:46:05,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:05,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:05,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:05,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:05,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:05,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:05,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:05,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:05,697 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-10 04:46:05,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:05,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:05,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:05,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:05,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:05,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:05,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:05,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:05,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:05,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:05,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:05,705 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:46:05,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:05,706 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:46:05,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:05,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:05,715 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-10 04:46:05,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:05,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:05,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:05,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:05,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:05,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:05,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:05,721 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-10 04:46:05,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:05,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:05,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:05,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:05,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:05,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:05,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:05,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:05,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:05,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:05,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:05,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:05,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:05,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:05,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:05,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:05,750 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-10 04:46:05,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:05,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:05,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:05,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:05,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:05,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:05,782 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:05,807 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 04:46:05,807 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 04:46:05,809 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:05,811 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:46:05,812 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:05,812 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~s.offset, v_rep(select #length ULTIMATE.start_strspn_~s.base)_1) = -1*ULTIMATE.start_strspn_~s.offset + 1*v_rep(select #length ULTIMATE.start_strspn_~s.base)_1 Supporting invariants [] [2018-11-10 04:46:05,879 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 04:46:05,885 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:46:05,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:05,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:05,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:05,971 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-10 04:46:05,974 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-10 04:46:05,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 26 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 04:46:06,012 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 26 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 40 states and 45 transitions. Complement of second has 6 states. [2018-11-10 04:46:06,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:46:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 04:46:06,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 14 letters. [2018-11-10 04:46:06,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:06,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 22 letters. Loop has 14 letters. [2018-11-10 04:46:06,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:06,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 28 letters. [2018-11-10 04:46:06,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:06,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2018-11-10 04:46:06,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 04:46:06,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 42 transitions. [2018-11-10 04:46:06,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 04:46:06,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 04:46:06,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2018-11-10 04:46:06,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:06,018 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-10 04:46:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2018-11-10 04:46:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 04:46:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 04:46:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-10 04:46:06,020 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-10 04:46:06,020 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-10 04:46:06,020 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:46:06,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-11-10 04:46:06,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:46:06,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:06,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:06,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:06,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:46:06,021 INFO L793 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 339#L521 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 332#L523 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L523 333#L523-1 main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 327#L525 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 328#L527 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L527 326#L527-1 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 318#L510-5 assume true; 320#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 346#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 336#L511-11 [2018-11-10 04:46:06,022 INFO L795 eck$LassoCheckResult]: Loop: 336#L511-11 assume true; 340#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 342#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 348#L511-3 assume !strspn_#t~short7; 323#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 329#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 336#L511-11 [2018-11-10 04:46:06,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash 839113167, now seen corresponding path program 1 times [2018-11-10 04:46:06,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:06,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:06,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:06,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:06,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1776000588, now seen corresponding path program 1 times [2018-11-10 04:46:06,044 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:06,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:06,071 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-10 04:46:06,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:46:06,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:46:06,072 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:46:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:46:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:46:06,072 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 04:46:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:46:06,080 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-10 04:46:06,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:46:06,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2018-11-10 04:46:06,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:46:06,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 38 transitions. [2018-11-10 04:46:06,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 04:46:06,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 04:46:06,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2018-11-10 04:46:06,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:06,082 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-10 04:46:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2018-11-10 04:46:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 04:46:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 04:46:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-10 04:46:06,085 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-10 04:46:06,085 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-10 04:46:06,085 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:46:06,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2018-11-10 04:46:06,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:46:06,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:06,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:06,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:06,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:06,087 INFO L793 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 418#L521 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 411#L523 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L523 412#L523-1 main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 406#L525 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 407#L527 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L527 405#L527-1 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 401#L510-5 assume true; 402#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 424#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 415#L511-11 [2018-11-10 04:46:06,087 INFO L795 eck$LassoCheckResult]: Loop: 415#L511-11 assume true; 419#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 421#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 426#L511-3 assume strspn_#t~short7; 428#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 430#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 397#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 398#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 408#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 415#L511-11 [2018-11-10 04:46:06,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 839113167, now seen corresponding path program 2 times [2018-11-10 04:46:06,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:06,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:06,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:06,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1021272990, now seen corresponding path program 1 times [2018-11-10 04:46:06,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:06,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:06,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:06,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash -126227884, now seen corresponding path program 1 times [2018-11-10 04:46:06,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:06,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:06,513 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 118 [2018-11-10 04:46:06,612 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:06,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:06,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:06,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:06,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:06,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:06,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:06,613 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:06,613 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration5_Lasso [2018-11-10 04:46:06,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:06,613 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:06,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,892 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 99 [2018-11-10 04:46:06,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:06,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:07,451 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:07,451 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:07,451 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-10 04:46:07,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:07,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:07,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:07,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,454 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-10 04:46:07,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:07,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:07,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,462 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-10 04:46:07,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:07,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:07,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:07,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,464 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-10 04:46:07,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:07,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:07,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:07,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,467 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-10 04:46:07,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:07,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:07,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,471 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-10 04:46:07,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:07,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:07,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:07,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,477 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-10 04:46:07,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:07,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:07,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,481 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-10 04:46:07,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:07,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:07,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,487 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-10 04:46:07,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,488 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:46:07,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,489 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:46:07,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:07,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,497 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-10 04:46:07,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:07,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:07,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:07,502 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-10 04:46:07,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:07,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:07,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:07,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:07,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:07,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:07,556 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:07,579 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:46:07,579 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:46:07,579 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:07,580 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:46:07,580 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:07,581 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 04:46:07,656 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2018-11-10 04:46:07,658 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:46:07,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:46:07,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 04:46:07,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:07,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:07,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:07,750 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-10 04:46:07,750 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 04:46:07,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 38 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-10 04:46:07,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 38 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 90 states and 96 transitions. Complement of second has 9 states. [2018-11-10 04:46:07,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:46:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 04:46:07,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 9 letters. [2018-11-10 04:46:07,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:07,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 20 letters. Loop has 9 letters. [2018-11-10 04:46:07,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:07,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 18 letters. [2018-11-10 04:46:07,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:07,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 96 transitions. [2018-11-10 04:46:07,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:46:07,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 61 states and 65 transitions. [2018-11-10 04:46:07,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 04:46:07,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 04:46:07,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2018-11-10 04:46:07,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:46:07,830 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-10 04:46:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2018-11-10 04:46:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-11-10 04:46:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 04:46:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-11-10 04:46:07,833 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-10 04:46:07,833 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-10 04:46:07,834 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:46:07,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 56 transitions. [2018-11-10 04:46:07,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:46:07,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:46:07,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:46:07,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:07,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:46:07,838 INFO L793 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 713#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 714#L521 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 704#L523 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L523 705#L523-1 main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 700#L525 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 701#L527 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L527 699#L527-1 assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 690#L510-5 assume true; 691#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 723#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 709#L511-11 assume true; 712#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 716#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 722#L511-3 assume strspn_#t~short7; 725#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 734#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 733#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 729#L511-8 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 717#L511-12 SUMMARY for call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-12 706#L512 assume !(strspn_#t~mem8 == 0);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := strspn_#t~post9 + 1;havoc strspn_#t~post9; 707#L510-4 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, strspn_#t~post2.offset + 1;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 692#L510-5 assume true; 693#L510-1 SUMMARY for call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L510-1 719#L510-2 assume !!(strspn_#t~mem10 != 0);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 708#L511-11 [2018-11-10 04:46:07,838 INFO L795 eck$LassoCheckResult]: Loop: 708#L511-11 assume true; 710#L511-1 SUMMARY for call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-1 715#L511-2 strspn_#t~short7 := strspn_#t~mem6 != 0; 721#L511-3 assume strspn_#t~short7; 724#L511-4 SUMMARY for call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1); srcloc: L511-4 726#L511-5 SUMMARY for call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); srcloc: L511-5 695#L511-6 strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 696#L511-8 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5; 702#L511-10 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, strspn_#t~post3.offset + 1;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 708#L511-11 [2018-11-10 04:46:07,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash -389762691, now seen corresponding path program 2 times [2018-11-10 04:46:07,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:07,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:07,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:46:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:07,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1021272990, now seen corresponding path program 2 times [2018-11-10 04:46:07,863 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:07,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:07,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:07,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:07,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:07,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1851402650, now seen corresponding path program 1 times [2018-11-10 04:46:07,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:46:07,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:46:07,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:07,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:46:07,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:46:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:46:08,441 WARN L179 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 148 [2018-11-10 04:46:08,536 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:46:08,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:46:08,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:46:08,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:46:08,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:46:08,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:46:08,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:46:08,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:46:08,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration6_Lasso [2018-11-10 04:46:08,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:46:08,536 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:46:08,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:46:08,903 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-11-10 04:46:09,446 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:46:09,447 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:46:09,447 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-10 04:46:09,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,449 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-10 04:46:09,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,451 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-10 04:46:09,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:09,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:09,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:09,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:46:09,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,459 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-10 04:46:09,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,461 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-10 04:46:09,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:09,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,463 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-10 04:46:09,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,466 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-10 04:46:09,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,468 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-10 04:46:09,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,470 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-10 04:46:09,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,472 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-10 04:46:09,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,473 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-10 04:46:09,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,475 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-10 04:46:09,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,478 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-10 04:46:09,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:09,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,481 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-10 04:46:09,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,483 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-10 04:46:09,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,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-10 04:46:09,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:46:09,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:46:09,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:46:09,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,487 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-10 04:46:09,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:09,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,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-10 04:46:09,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:09,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,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-10 04:46:09,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,501 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:46:09,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,502 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:46:09,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,508 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-10 04:46:09,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:09,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,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-10 04:46:09,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:09,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:46:09,515 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-10 04:46:09,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:46:09,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:46:09,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:46:09,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:46:09,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:46:09,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:46:09,560 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:46:09,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:46:09,582 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 04:46:09,583 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:46:09,584 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:46:09,584 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:46:09,584 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 Supporting invariants [] [2018-11-10 04:46:09,698 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-10 04:46:09,700 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:46:09,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:46:09,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 04:46:09,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:09,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:09,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:09,800 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-10 04:46:09,800 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 04:46:09,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 04:46:09,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 84 states and 88 transitions. Complement of second has 9 states. [2018-11-10 04:46:09,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:46:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 04:46:09,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 25 letters. Loop has 9 letters. [2018-11-10 04:46:09,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:09,884 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:46:09,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:09,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:09,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:09,968 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-10 04:46:09,968 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 04:46:09,968 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 04:46:10,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 84 states and 88 transitions. Complement of second has 9 states. [2018-11-10 04:46:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:46:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 04:46:10,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 25 letters. Loop has 9 letters. [2018-11-10 04:46:10,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:10,018 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:46:10,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:46:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:10,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:46:10,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:46:10,105 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-10 04:46:10,105 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 04:46:10,105 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 04:46:10,146 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 93 states and 98 transitions. Complement of second has 8 states. [2018-11-10 04:46:10,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:46:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:46:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-10 04:46:10,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 25 letters. Loop has 9 letters. [2018-11-10 04:46:10,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 34 letters. Loop has 9 letters. [2018-11-10 04:46:10,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 40 transitions. Stem has 25 letters. Loop has 18 letters. [2018-11-10 04:46:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:46:10,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 98 transitions. [2018-11-10 04:46:10,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:46:10,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 0 states and 0 transitions. [2018-11-10 04:46:10,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:46:10,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:46:10,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:46:10,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:46:10,152 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:10,152 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:10,152 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:46:10,152 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:46:10,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:46:10,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:46:10,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:46:10,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:46:10 BoogieIcfgContainer [2018-11-10 04:46:10,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:46:10,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:46:10,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:46:10,158 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:46:10,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:46:03" (3/4) ... [2018-11-10 04:46:10,162 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:46:10,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:46:10,163 INFO L168 Benchmark]: Toolchain (without parser) took 7204.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -254.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:10,163 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:10,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.22 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:10,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:10,165 INFO L168 Benchmark]: Boogie Preprocessor took 25.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:10,165 INFO L168 Benchmark]: RCFGBuilder took 256.72 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:46:10,165 INFO L168 Benchmark]: BuchiAutomizer took 6461.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:10,166 INFO L168 Benchmark]: Witness Printer took 4.03 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:46:10,169 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.22 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 256.72 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6461.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 180 SDtfs, 189 SDslu, 123 SDs, 0 SdLazy, 138 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital237 mio100 ax100 hnf99 lsp95 ukn100 mio100 lsp37 div100 bol100 ite100 ukn100 eq195 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...