./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/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_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/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-635dfa2 [2018-12-01 16:39:01,472 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:39:01,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:39:01,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:39:01,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:39:01,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:39:01,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:39:01,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:39:01,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:39:01,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:39:01,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:39:01,485 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:39:01,486 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:39:01,487 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:39:01,487 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:39:01,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:39:01,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:39:01,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:39:01,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:39:01,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:39:01,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:39:01,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:39:01,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:39:01,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:39:01,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:39:01,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:39:01,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:39:01,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:39:01,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:39:01,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:39:01,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:39:01,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:39:01,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:39:01,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:39:01,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:39:01,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:39:01,501 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 16:39:01,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:39:01,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:39:01,513 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:39:01,513 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:39:01,513 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 16:39:01,513 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 16:39:01,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:39:01,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 16:39:01,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 16:39:01,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 16:39:01,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 16:39:01,515 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 16:39:01,515 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:39:01,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 16:39:01,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:39:01,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 16:39:01,516 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 16:39:01,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:39:01,516 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 16:39:01,516 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 16:39:01,516 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 16:39:01,516 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_abff8859-8ecf-4275-b984-871375ec2860/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-12-01 16:39:01,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:39:01,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:39:01,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:39:01,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:39:01,549 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:39:01,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-12-01 16:39:01,587 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/data/95fde0d37/6276eee17aee4b07a9a33c5a2a8c1313/FLAG263889676 [2018-12-01 16:39:02,089 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:39:02,090 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-12-01 16:39:02,096 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/data/95fde0d37/6276eee17aee4b07a9a33c5a2a8c1313/FLAG263889676 [2018-12-01 16:39:02,104 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/bin-2019/uautomizer/data/95fde0d37/6276eee17aee4b07a9a33c5a2a8c1313 [2018-12-01 16:39:02,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:39:02,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 16:39:02,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:39:02,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:39:02,110 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:39:02,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02, skipping insertion in model container [2018-12-01 16:39:02,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:39:02,133 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:39:02,273 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:39:02,279 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:39:02,335 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:39:02,355 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:39:02,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02 WrapperNode [2018-12-01 16:39:02,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:39:02,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 16:39:02,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 16:39:02,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 16:39:02,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 16:39:02,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:39:02,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:39:02,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:39:02,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... [2018-12-01 16:39:02,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:39:02,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:39:02,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:39:02,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:39:02,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abff8859-8ecf-4275-b984-871375ec2860/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-12-01 16:39:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 16:39:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 16:39:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 16:39:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 16:39:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:39:02,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:39:02,568 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:39:02,568 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 16:39:02,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:39:02 BoogieIcfgContainer [2018-12-01 16:39:02,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:39:02,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 16:39:02,569 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 16:39:02,571 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 16:39:02,571 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 16:39:02,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 04:39:02" (1/3) ... [2018-12-01 16:39:02,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e24aeb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 04:39:02, skipping insertion in model container [2018-12-01 16:39:02,572 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 16:39:02,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:39:02" (2/3) ... [2018-12-01 16:39:02,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e24aeb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 04:39:02, skipping insertion in model container [2018-12-01 16:39:02,573 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 16:39:02,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:39:02" (3/3) ... [2018-12-01 16:39:02,574 INFO L375 chiAutomizerObserver]: Analyzing ICFG strspn_true-termination.c.i [2018-12-01 16:39:02,607 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 16:39:02,607 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 16:39:02,607 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 16:39:02,607 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 16:39:02,607 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 16:39:02,608 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 16:39:02,608 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 16:39:02,608 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 16:39:02,608 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 16:39:02,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-01 16:39:02,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-01 16:39:02,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:39:02,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:39:02,636 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 16:39:02,636 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 16:39:02,636 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 16:39:02,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-01 16:39:02,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-01 16:39:02,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:39:02,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:39:02,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 16:39:02,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 16:39:02,642 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 9#L521true assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 6#L525true assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 19#L510-4true [2018-12-01 16:39:02,643 INFO L796 eck$LassoCheckResult]: Loop: 19#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 12#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4#L511-6true assume !true; 5#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 7#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 15#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 19#L510-4true [2018-12-01 16:39:02,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-01 16:39:02,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:02,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:02,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1366197546, now seen corresponding path program 1 times [2018-12-01 16:39:02,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:02,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:02,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:02,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 16:39:02,753 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 16:39:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 16:39:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 16:39:02,763 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-01 16:39:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:02,767 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-01 16:39:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 16:39:02,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-01 16:39:02,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-01 16:39:02,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2018-12-01 16:39:02,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-01 16:39:02,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 16:39:02,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-12-01 16:39:02,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 16:39:02,773 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-01 16:39:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-12-01 16:39:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-01 16:39:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 16:39:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-01 16:39:02,789 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-01 16:39:02,789 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-01 16:39:02,789 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 16:39:02,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-12-01 16:39:02,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-01 16:39:02,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:39:02,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:39:02,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 16:39:02,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:02,791 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 52#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 48#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 49#L510-4 [2018-12-01 16:39:02,791 INFO L796 eck$LassoCheckResult]: Loop: 49#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 55#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 44#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 45#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 53#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6; 46#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 47#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 50#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 49#L510-4 [2018-12-01 16:39:02,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-12-01 16:39:02,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:02,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1786909933, now seen corresponding path program 1 times [2018-12-01 16:39:02,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:02,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:39:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:02,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1162005510, now seen corresponding path program 1 times [2018-12-01 16:39:02,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:02,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:03,164 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-12-01 16:39:03,232 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 16:39:03,233 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 16:39:03,233 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 16:39:03,233 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 16:39:03,233 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 16:39:03,233 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 16:39:03,233 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 16:39:03,233 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 16:39:03,233 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration2_Lasso [2018-12-01 16:39:03,233 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 16:39:03,234 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 16:39:03,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:03,736 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 16:39:03,740 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 16:39:03,742 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-12-01 16:39:03,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:03,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:03,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:03,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,749 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-12-01 16:39:03,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:03,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:03,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:03,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,752 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-12-01 16:39:03,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:03,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:03,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:03,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,755 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-12-01 16:39:03,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:03,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:03,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:03,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,758 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-12-01 16:39:03,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:03,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:03,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:03,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,760 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-12-01 16:39:03,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:03,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:03,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,766 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-12-01 16:39:03,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:03,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,767 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 16:39:03,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,768 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 16:39:03,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:03,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,773 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-12-01 16:39:03,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:03,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:03,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,793 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-12-01 16:39:03,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:03,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:03,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,798 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-12-01 16:39:03,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:03,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:03,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:03,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,802 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-12-01 16:39:03,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:03,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:03,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,807 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-12-01 16:39:03,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,808 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:39:03,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,810 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:39:03,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:03,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:03,824 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-12-01 16:39:03,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:03,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:03,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:03,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:03,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:03,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:03,851 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 16:39:03,861 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 16:39:03,861 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 16:39:03,862 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 16:39:03,863 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 16:39:03,864 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 16:39:03,864 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2018-12-01 16:39:03,896 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-01 16:39:03,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 16:39:03,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:03,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:03,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:03,983 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 16:39:03,983 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-01 16:39:04,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 5 states. [2018-12-01 16:39:04,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 16:39:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 16:39:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-01 16:39:04,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2018-12-01 16:39:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 8 letters. [2018-12-01 16:39:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:04,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 16 letters. [2018-12-01 16:39:04,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:04,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-12-01 16:39:04,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 16:39:04,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 24 transitions. [2018-12-01 16:39:04,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 16:39:04,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 16:39:04,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-12-01 16:39:04,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:39:04,043 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 16:39:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-12-01 16:39:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-01 16:39:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-01 16:39:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-01 16:39:04,045 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 16:39:04,045 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-01 16:39:04,045 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 16:39:04,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-01 16:39:04,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 16:39:04,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:39:04,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:39:04,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 16:39:04,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 16:39:04,046 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 189#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 185#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 186#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 193#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 179#L511-6 [2018-12-01 16:39:04,047 INFO L796 eck$LassoCheckResult]: Loop: 179#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 180#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 190#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6; 195#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 179#L511-6 [2018-12-01 16:39:04,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-12-01 16:39:04,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:04,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:04,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:04,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:04,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:04,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 1 times [2018-12-01 16:39:04,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:04,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:04,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:04,072 INFO L82 PathProgramCache]: Analyzing trace with hash 736220242, now seen corresponding path program 1 times [2018-12-01 16:39:04,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:04,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:04,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:04,359 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-12-01 16:39:04,426 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 16:39:04,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 16:39:04,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 16:39:04,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 16:39:04,426 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 16:39:04,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 16:39:04,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 16:39:04,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 16:39:04,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration3_Lasso [2018-12-01 16:39:04,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 16:39:04,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 16:39:04,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,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-12-01 16:39:04,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,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-12-01 16:39:04,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:04,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 16:39:04,902 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 16:39:04,902 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-12-01 16:39:04,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:04,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:04,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:04,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:04,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:04,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:04,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:04,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:04,905 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-12-01 16:39:04,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:04,905 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:39:04,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:04,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:04,907 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:39:04,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:04,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:04,915 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-12-01 16:39:04,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:04,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:04,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:04,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:04,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:04,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:04,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:04,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:39:04,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:04,919 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:39:04,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:04,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:04,920 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:39:04,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:04,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:04,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:39:04,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:04,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:04,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:04,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:04,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:04,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:04,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:04,928 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-12-01 16:39:04,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:04,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:04,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:04,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:04,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:04,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:04,950 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 16:39:04,962 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 16:39:04,962 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-01 16:39:04,962 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 16:39:04,963 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 16:39:04,963 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 16:39:04,963 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-12-01 16:39:04,996 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-12-01 16:39:04,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 16:39:05,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:05,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:05,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:05,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 16:39:05,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-01 16:39:05,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 6 states. [2018-12-01 16:39:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 16:39:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 16:39:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-01 16:39:05,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-01 16:39:05,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:05,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-01 16:39:05,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:05,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-01 16:39:05,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:05,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-12-01 16:39:05,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 16:39:05,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 40 transitions. [2018-12-01 16:39:05,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 16:39:05,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 16:39:05,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-12-01 16:39:05,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:39:05,082 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-12-01 16:39:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-12-01 16:39:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-12-01 16:39:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-01 16:39:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-01 16:39:05,084 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-01 16:39:05,084 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-01 16:39:05,084 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 16:39:05,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-12-01 16:39:05,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 16:39:05,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:39:05,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:39:05,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:05,086 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 16:39:05,086 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 378#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 379#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 375#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 376#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 385#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 386#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 381#L511-1 assume !strspn_#t~short7; 382#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6; 373#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 374#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 377#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 388#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 384#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 369#L511-6 [2018-12-01 16:39:05,086 INFO L796 eck$LassoCheckResult]: Loop: 369#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 370#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 380#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6; 387#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 369#L511-6 [2018-12-01 16:39:05,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1779209729, now seen corresponding path program 1 times [2018-12-01 16:39:05,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:05,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:05,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:39:05,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:39:05,126 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 16:39:05,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 2 times [2018-12-01 16:39:05,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:05,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:39:05,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:39:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:39:05,209 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-01 16:39:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:39:05,230 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-12-01 16:39:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:39:05,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-12-01 16:39:05,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 16:39:05,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 38 transitions. [2018-12-01 16:39:05,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-01 16:39:05,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-01 16:39:05,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2018-12-01 16:39:05,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 16:39:05,232 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-01 16:39:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2018-12-01 16:39:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-12-01 16:39:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-01 16:39:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-12-01 16:39:05,233 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-01 16:39:05,234 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-01 16:39:05,234 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 16:39:05,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-12-01 16:39:05,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 16:39:05,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 16:39:05,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 16:39:05,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:39:05,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 16:39:05,235 INFO L794 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 450#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 446#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 447#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 456#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 457#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 465#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 462#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6; 444#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 445#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 448#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 460#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 455#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 440#L511-6 [2018-12-01 16:39:05,235 INFO L796 eck$LassoCheckResult]: Loop: 440#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 441#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 451#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6; 458#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 440#L511-6 [2018-12-01 16:39:05,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash 4202367, now seen corresponding path program 2 times [2018-12-01 16:39:05,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:05,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:39:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:05,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 3 times [2018-12-01 16:39:05,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:05,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:05,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:39:05,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:05,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:05,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1675488540, now seen corresponding path program 1 times [2018-12-01 16:39:05,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:39:05,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:39:05,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:39:05,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:39:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:39:05,689 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 130 [2018-12-01 16:39:05,760 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 16:39:05,761 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 16:39:05,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 16:39:05,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 16:39:05,761 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 16:39:05,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 16:39:05,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 16:39:05,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 16:39:05,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration5_Lasso [2018-12-01 16:39:05,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 16:39:05,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 16:39:05,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:05,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:05,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:05,986 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-12-01 16:39:06,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 16:39:06,354 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 16:39:06,355 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 16:39:06,355 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-12-01 16:39:06,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:06,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:06,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:06,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:06,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,357 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-12-01 16:39:06,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 16:39:06,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:06,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 16:39:06,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 16:39:06,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,358 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-12-01 16:39:06,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:06,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:06,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:06,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,361 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-12-01 16:39:06,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,361 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:39:06,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,363 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:39:06,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:06,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 16:39:06,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:06,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:06,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:06,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,369 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-12-01 16:39:06,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,370 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 16:39:06,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,371 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 16:39:06,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:06,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,375 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-12-01 16:39:06,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,376 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-01 16:39:06,376 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-01 16:39:06,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,384 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-12-01 16:39:06,384 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-01 16:39:06,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,417 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-12-01 16:39:06,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:06,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:06,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:06,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,420 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-12-01 16:39:06,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:06,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:06,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:06,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,422 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-12-01 16:39:06,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:06,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:06,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:06,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 16:39:06,426 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-12-01 16:39:06,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 16:39:06,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 16:39:06,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 16:39:06,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 16:39:06,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 16:39:06,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 16:39:06,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 16:39:06,444 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 16:39:06,444 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 16:39:06,444 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 16:39:06,445 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 16:39:06,445 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 16:39:06,445 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3 Supporting invariants [] [2018-12-01 16:39:06,535 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2018-12-01 16:39:06,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 16:39:06,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:06,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:06,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:06,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 16:39:06,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-01 16:39:06,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2018-12-01 16:39:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 16:39:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 16:39:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-01 16:39:06,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-01 16:39:06,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:06,619 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 16:39:06,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:06,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:06,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:06,663 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 16:39:06,663 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-01 16:39:06,684 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2018-12-01 16:39:06,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 16:39:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 16:39:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-01 16:39:06,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-01 16:39:06,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:06,685 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 16:39:06,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:39:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:06,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:06,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:39:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:06,735 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 16:39:06,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-01 16:39:06,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 57 transitions. Complement of second has 5 states. [2018-12-01 16:39:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 16:39:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 16:39:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-12-01 16:39:06,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-01 16:39:06,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:06,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2018-12-01 16:39:06,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:06,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 8 letters. [2018-12-01 16:39:06,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 16:39:06,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-12-01 16:39:06,757 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 16:39:06,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2018-12-01 16:39:06,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 16:39:06,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 16:39:06,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 16:39:06,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 16:39:06,758 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 16:39:06,758 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 16:39:06,758 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 16:39:06,758 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 16:39:06,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 16:39:06,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 16:39:06,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 16:39:06,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 04:39:06 BoogieIcfgContainer [2018-12-01 16:39:06,762 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 16:39:06,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:39:06,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:39:06,762 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:39:06,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:39:02" (3/4) ... [2018-12-01 16:39:06,764 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 16:39:06,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:39:06,765 INFO L168 Benchmark]: Toolchain (without parser) took 4658.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 951.7 MB in the beginning and 883.3 MB in the end (delta: 68.4 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. [2018-12-01 16:39:06,765 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:39:06,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-01 16:39:06,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-01 16:39:06,766 INFO L168 Benchmark]: Boogie Preprocessor took 15.48 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-12-01 16:39:06,766 INFO L168 Benchmark]: RCFGBuilder took 170.68 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-12-01 16:39:06,767 INFO L168 Benchmark]: BuchiAutomizer took 4193.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 883.3 MB in the end (delta: 208.2 MB). Peak memory consumption was 390.6 MB. Max. memory is 11.5 GB. [2018-12-01 16:39:06,767 INFO L168 Benchmark]: Witness Printer took 2.55 ms. Allocated memory is still 1.3 GB. Free memory is still 883.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:39:06,769 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.48 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 170.68 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4193.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 883.3 MB in the end (delta: 208.2 MB). Peak memory consumption was 390.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.55 ms. Allocated memory is still 1.3 GB. Free memory is still 883.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * a and consists of 4 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 100 SDtfs, 125 SDslu, 46 SDs, 0 SdLazy, 80 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax100 hnf99 lsp95 ukn80 mio100 lsp39 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...