./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strspn.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strspn.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/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.24-cad4683 [2019-10-22 08:55:07,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:07,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:07,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:07,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:07,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:07,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:07,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:07,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:07,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:07,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:07,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:07,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:07,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:07,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:07,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:07,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:07,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:07,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:07,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:07,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:07,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:07,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:07,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:07,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:07,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:07,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:07,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:07,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:07,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:07,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:07,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:07,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:07,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:07,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:07,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:07,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:07,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:07,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:07,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:07,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:07,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:55:07,343 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:07,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:07,344 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:07,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:07,345 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:07,345 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:07,345 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:07,345 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:07,345 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:07,346 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:07,346 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:07,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:07,346 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:07,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:07,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:07,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:07,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:07,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:07,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:07,347 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:07,347 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:07,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:07,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:07,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:07,348 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:07,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:07,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:07,349 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:07,350 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:07,350 INFO L138 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_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/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 [2019-10-22 08:55:07,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:07,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:07,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:07,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:07,389 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:07,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strspn.i [2019-10-22 08:55:07,442 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/data/76764ba38/8ffd05a7182f47aba436dcd080b4aa5a/FLAG8e8ca3ba2 [2019-10-22 08:55:07,833 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:07,836 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/sv-benchmarks/c/termination-libowfat/strspn.i [2019-10-22 08:55:07,846 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/data/76764ba38/8ffd05a7182f47aba436dcd080b4aa5a/FLAG8e8ca3ba2 [2019-10-22 08:55:07,857 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/uautomizer/data/76764ba38/8ffd05a7182f47aba436dcd080b4aa5a [2019-10-22 08:55:07,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:07,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:07,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:07,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:07,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:07,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e097a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:07, skipping insertion in model container [2019-10-22 08:55:07,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:07" (1/1) ... [2019-10-22 08:55:07,878 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:07,923 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:08,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:08,250 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:08,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:08,335 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:08,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08 WrapperNode [2019-10-22 08:55:08,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:08,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:08,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:08,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:08,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:08,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:08,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:08,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:08,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... [2019-10-22 08:55:08,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:08,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:08,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:08,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:08,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edb6ad3-c3d0-49d3-be53-1ad89231b019/bin/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 [2019-10-22 08:55:08,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:55:08,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:08,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:08,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:08,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:08,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:08,860 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:08,860 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:55:08,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:08 BoogieIcfgContainer [2019-10-22 08:55:08,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:08,862 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:08,862 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:08,866 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:08,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:08,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:07" (1/3) ... [2019-10-22 08:55:08,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9baec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:08, skipping insertion in model container [2019-10-22 08:55:08,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:08,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:08" (2/3) ... [2019-10-22 08:55:08,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9baec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:08, skipping insertion in model container [2019-10-22 08:55:08,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:08,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:08" (3/3) ... [2019-10-22 08:55:08,871 INFO L371 chiAutomizerObserver]: Analyzing ICFG strspn.i [2019-10-22 08:55:08,924 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:08,924 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:08,924 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:08,924 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:08,924 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:08,925 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:08,925 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:08,925 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:08,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:55:08,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:55:08,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:08,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:08,967 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:55:08,967 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:08,967 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:08,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:55:08,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:55:08,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:08,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:08,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:55:08,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:08,978 INFO L791 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.allocOnStack(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.allocOnStack(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 [2019-10-22 08:55:08,979 INFO L793 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 [2019-10-22 08:55:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-10-22 08:55:08,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401133765] [2019-10-22 08:55:08,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,115 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1366197546, now seen corresponding path program 1 times [2019-10-22 08:55:09,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319443824] [2019-10-22 08:55:09,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319443824] [2019-10-22 08:55:09,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:09,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:09,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457692630] [2019-10-22 08:55:09,159 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:09,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:55:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:09,175 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 08:55:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,182 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 08:55:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:09,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 08:55:09,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:55:09,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2019-10-22 08:55:09,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:55:09,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:55:09,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-10-22 08:55:09,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:09,190 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:55:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-10-22 08:55:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:55:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:55:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-10-22 08:55:09,214 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:55:09,214 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:55:09,215 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:09,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-10-22 08:55:09,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:55:09,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:09,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:09,216 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:55:09,216 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:09,216 INFO L791 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.allocOnStack(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.allocOnStack(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 [2019-10-22 08:55:09,216 INFO L793 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~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 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 [2019-10-22 08:55:09,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-10-22 08:55:09,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381319771] [2019-10-22 08:55:09,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,254 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1786909933, now seen corresponding path program 1 times [2019-10-22 08:55:09,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291261045] [2019-10-22 08:55:09,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,274 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1162005510, now seen corresponding path program 1 times [2019-10-22 08:55:09,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292989730] [2019-10-22 08:55:09,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,359 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,550 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-22 08:55:09,966 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-10-22 08:55:10,076 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:10,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:10,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:10,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:10,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:10,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:10,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:10,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:10,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration2_Lasso [2019-10-22 08:55:10,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:10,080 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:10,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,449 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-22 08:55:10,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,061 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 08:55:11,181 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:11,189 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:11,191 INFO L120 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 [2019-10-22 08:55:11,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,202 INFO L120 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 [2019-10-22 08:55:11,203 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,203 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,204 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,212 INFO L120 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 [2019-10-22 08:55:11,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,215 INFO L120 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 [2019-10-22 08:55:11,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,215 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,216 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,216 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,216 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,220 INFO L120 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 [2019-10-22 08:55:11,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,221 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,221 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,222 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,223 INFO L120 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 [2019-10-22 08:55:11,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,223 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,223 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,228 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:11,228 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:11,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,232 INFO L120 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 [2019-10-22 08:55:11,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,236 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,237 INFO L120 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 [2019-10-22 08:55:11,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,240 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:11,240 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:11,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,245 INFO L120 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 [2019-10-22 08:55:11,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,247 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,248 INFO L120 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 [2019-10-22 08:55:11,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,252 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,253 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,253 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,255 INFO L120 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 [2019-10-22 08:55:11,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,255 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,256 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,256 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,258 INFO L120 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 [2019-10-22 08:55:11,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,258 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,259 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,259 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,259 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,261 INFO L120 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 [2019-10-22 08:55:11,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,263 INFO L120 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 [2019-10-22 08:55:11,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,265 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,266 INFO L120 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 [2019-10-22 08:55:11,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,267 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,268 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,269 INFO L120 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 [2019-10-22 08:55:11,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,270 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,270 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,271 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,272 INFO L120 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 [2019-10-22 08:55:11,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,273 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:55:11,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,279 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:55:11,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:11,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,320 INFO L120 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 [2019-10-22 08:55:11,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,321 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,322 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:11,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,322 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:11,322 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,326 INFO L120 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 [2019-10-22 08:55:11,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,330 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:11,330 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:11,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,342 INFO L120 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 [2019-10-22 08:55:11,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,343 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:11,344 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:11,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,346 INFO L120 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 [2019-10-22 08:55:11,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:11,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:11,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:11,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,349 INFO L120 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 [2019-10-22 08:55:11,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,351 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:11,351 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:11,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:11,354 INFO L120 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 [2019-10-22 08:55:11,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:11,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:11,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:11,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:11,357 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:11,358 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:11,398 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:11,433 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:55:11,436 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:55:11,438 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:11,440 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:11,442 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:11,443 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~s.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~s.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2019-10-22 08:55:11,466 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:55:11,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:11,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:11,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:11,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:11,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:11,547 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:11,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-10-22 08:55:11,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 4 states. [2019-10-22 08:55:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-10-22 08:55:11,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2019-10-22 08:55:11,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:11,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 8 letters. [2019-10-22 08:55:11,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:11,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 16 letters. [2019-10-22 08:55:11,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:11,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-10-22 08:55:11,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:55:11,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 24 transitions. [2019-10-22 08:55:11,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:55:11,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:55:11,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-10-22 08:55:11,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:11,614 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 08:55:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-10-22 08:55:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 08:55:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:55:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-10-22 08:55:11,616 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 08:55:11,616 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 08:55:11,616 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:11,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-10-22 08:55:11,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:55:11,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:11,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:11,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:11,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:55:11,625 INFO L791 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#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; 181#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(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; 177#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(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; 178#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 185#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; 171#L511-6 [2019-10-22 08:55:11,625 INFO L793 eck$LassoCheckResult]: Loop: 171#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 172#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; 182#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 187#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; 171#L511-6 [2019-10-22 08:55:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,625 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2019-10-22 08:55:11,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955109325] [2019-10-22 08:55:11,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,671 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 1 times [2019-10-22 08:55:11,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16151089] [2019-10-22 08:55:11,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,691 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 736220242, now seen corresponding path program 1 times [2019-10-22 08:55:11,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773824533] [2019-10-22 08:55:11,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,730 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:12,135 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-10-22 08:55:12,269 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-22 08:55:12,271 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:12,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:12,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:12,271 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:12,271 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:12,271 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:12,271 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:12,271 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:12,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration3_Lasso [2019-10-22 08:55:12,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:12,272 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:12,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,514 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-10-22 08:55:12,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:13,056 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:55:13,181 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:13,181 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:13,181 INFO L120 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 [2019-10-22 08:55:13,182 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:13,182 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:13,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:13,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:13,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:13,183 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:13,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:13,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:13,184 INFO L120 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 [2019-10-22 08:55:13,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:13,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:13,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:13,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:13,186 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:13,186 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:13,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:13,188 INFO L120 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 [2019-10-22 08:55:13,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:13,189 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:55:13,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:13,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:13,193 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:55:13,193 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:13,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:13,214 INFO L120 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 [2019-10-22 08:55:13,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:13,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:13,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:13,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:13,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:13,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:13,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:13,217 INFO L120 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 [2019-10-22 08:55:13,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:13,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:13,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:13,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:13,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:13,222 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:13,272 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:13,293 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:55:13,293 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:55:13,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:13,295 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:13,295 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:13,295 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_2, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_2 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2019-10-22 08:55:13,336 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 08:55:13,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:13,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:13,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:13,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:13,391 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:13,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:55:13,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 48 states and 60 transitions. Complement of second has 5 states. [2019-10-22 08:55:13,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 08:55:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:55:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:55:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2019-10-22 08:55:13,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:13,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2019-10-22 08:55:13,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:55:13,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 40 transitions. [2019-10-22 08:55:13,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:55:13,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:55:13,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2019-10-22 08:55:13,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:13,418 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-10-22 08:55:13,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2019-10-22 08:55:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-10-22 08:55:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 08:55:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-10-22 08:55:13,420 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-22 08:55:13,420 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-22 08:55:13,421 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:13,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-10-22 08:55:13,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:55:13,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:13,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:13,422 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:13,422 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:55:13,422 INFO L791 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#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; 363#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(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; 359#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(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; 360#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 369#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; 370#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 365#L511-1 assume !strspn_#t~short7; 366#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 357#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 358#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; 361#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; 372#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 368#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; 353#L511-6 [2019-10-22 08:55:13,422 INFO L793 eck$LassoCheckResult]: Loop: 353#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 354#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; 364#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 371#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; 353#L511-6 [2019-10-22 08:55:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1779209729, now seen corresponding path program 1 times [2019-10-22 08:55:13,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830931428] [2019-10-22 08:55:13,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:13,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830931428] [2019-10-22 08:55:13,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:13,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:13,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912161076] [2019-10-22 08:55:13,469 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 2 times [2019-10-22 08:55:13,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181506497] [2019-10-22 08:55:13,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,480 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:13,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:13,606 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 08:55:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:13,649 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-10-22 08:55:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:13,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2019-10-22 08:55:13,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:55:13,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 38 transitions. [2019-10-22 08:55:13,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:55:13,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:55:13,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2019-10-22 08:55:13,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:13,652 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 08:55:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2019-10-22 08:55:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-10-22 08:55:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:55:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-10-22 08:55:13,654 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-10-22 08:55:13,654 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-10-22 08:55:13,654 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:13,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-10-22 08:55:13,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:55:13,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:13,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:13,656 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:13,656 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:55:13,656 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 433#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; 434#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(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; 430#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(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; 431#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 440#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; 441#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 449#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; 446#L511-3 assume !strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 428#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 429#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; 432#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; 444#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 439#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; 424#L511-6 [2019-10-22 08:55:13,656 INFO L793 eck$LassoCheckResult]: Loop: 424#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 425#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; 435#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 442#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; 424#L511-6 [2019-10-22 08:55:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 4202367, now seen corresponding path program 2 times [2019-10-22 08:55:13,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887424453] [2019-10-22 08:55:13,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,691 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 3 times [2019-10-22 08:55:13,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343939888] [2019-10-22 08:55:13,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,702 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1675488540, now seen corresponding path program 1 times [2019-10-22 08:55:13,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504145469] [2019-10-22 08:55:13,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,737 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:14,411 WARN L191 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 133 [2019-10-22 08:55:14,522 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:14,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:14,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:14,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:14,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:14,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:14,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:14,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:14,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn.i_Iteration5_Lasso [2019-10-22 08:55:14,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:14,522 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:14,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,843 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-10-22 08:55:14,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:14,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,350 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:55:15,498 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:15,498 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:15,500 INFO L120 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 [2019-10-22 08:55:15,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,501 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,501 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,502 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,502 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,503 INFO L120 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 [2019-10-22 08:55:15,503 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,504 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,504 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,504 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,504 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,505 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,505 INFO L120 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 [2019-10-22 08:55:15,506 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,506 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,506 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,507 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:15,507 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,509 INFO L120 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 [2019-10-22 08:55:15,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,510 INFO L120 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 [2019-10-22 08:55:15,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,511 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,512 INFO L120 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 [2019-10-22 08:55:15,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,513 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,513 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,513 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,513 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,514 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,514 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,514 INFO L120 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 [2019-10-22 08:55:15,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,515 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,516 INFO L120 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 [2019-10-22 08:55:15,517 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,517 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,518 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,518 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,519 INFO L120 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 [2019-10-22 08:55:15,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,521 INFO L120 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 [2019-10-22 08:55:15,521 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,522 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:15,522 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,524 INFO L120 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 [2019-10-22 08:55:15,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:15,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,525 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:15,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:15,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,526 INFO L120 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 [2019-10-22 08:55:15,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,526 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:55:15,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,530 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:55:15,530 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,546 INFO L120 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 [2019-10-22 08:55:15,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,548 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:15,548 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,551 INFO L120 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 [2019-10-22 08:55:15,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:15,553 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,554 INFO L120 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 [2019-10-22 08:55:15,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,555 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:55:15,555 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-10-22 08:55:15,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,563 INFO L400 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2019-10-22 08:55:15,563 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-10-22 08:55:15,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,615 INFO L120 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 [2019-10-22 08:55:15,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,617 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:15,617 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,619 INFO L120 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 [2019-10-22 08:55:15,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,620 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:15,620 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,621 INFO L120 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 [2019-10-22 08:55:15,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,623 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:15,623 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:15,627 INFO L120 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 [2019-10-22 08:55:15,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:15,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:15,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:15,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:15,630 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:15,630 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:15,668 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:15,708 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:55:15,713 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:55:15,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:15,714 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:15,714 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:15,714 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_3, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_3 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2019-10-22 08:55:15,807 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-10-22 08:55:15,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:15,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:15,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:15,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:15,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:15,854 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:15,854 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:55:15,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 5 states. [2019-10-22 08:55:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 08:55:15,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:55:15,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:15,873 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:15,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:15,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:15,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:15,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:15,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:15,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:55:15,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 5 states. [2019-10-22 08:55:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 08:55:15,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:55:15,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:15,933 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:15,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:15,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:15,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:15,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:15,981 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:15,981 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:55:15,999 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 46 states and 57 transitions. Complement of second has 4 states. [2019-10-22 08:55:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-10-22 08:55:16,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:55:16,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:16,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2019-10-22 08:55:16,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:16,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 14 letters. Loop has 8 letters. [2019-10-22 08:55:16,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:16,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2019-10-22 08:55:16,004 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:16,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-10-22 08:55:16,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:16,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:16,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:16,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:16,005 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:16,005 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:16,005 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:16,005 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:16,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:16,005 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:16,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:16,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:16 BoogieIcfgContainer [2019-10-22 08:55:16,011 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:16,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:16,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:16,012 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:16,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:08" (3/4) ... [2019-10-22 08:55:16,015 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:16,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:16,017 INFO L168 Benchmark]: Toolchain (without parser) took 8157.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.3 MB). Free memory was 939.2 MB in the beginning and 967.9 MB in the end (delta: -28.8 MB). Peak memory consumption was 203.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:16,017 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:16,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:16,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.41 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. [2019-10-22 08:55:16,018 INFO L168 Benchmark]: Boogie Preprocessor took 48.27 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:16,019 INFO L168 Benchmark]: RCFGBuilder took 423.44 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:16,019 INFO L168 Benchmark]: BuchiAutomizer took 7149.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 967.9 MB in the end (delta: 126.0 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:16,020 INFO L168 Benchmark]: Witness Printer took 4.09 ms. Allocated memory is still 1.3 GB. Free memory is still 967.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:16,022 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 475.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.27 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 423.44 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7149.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 967.9 MB in the end (delta: 126.0 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.09 ms. Allocated memory is still 1.3 GB. Free memory is still 967.9 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[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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: 105 SDtfs, 90 SDslu, 37 SDs, 0 SdLazy, 73 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax100 hnf99 lsp95 ukn80 mio100 lsp39 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf219 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms 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...