./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eaca3e09b762fe94634aa0b3e6a04213782212a5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:40:58,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:40:58,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:40:58,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:40:58,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:40:58,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:40:58,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:40:58,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:40:58,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:40:58,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:40:58,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:40:58,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:40:58,352 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:40:58,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:40:58,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:40:58,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:40:58,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:40:58,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:40:58,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:40:58,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:40:58,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:40:58,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:40:58,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:40:58,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:40:58,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:40:58,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:40:58,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:40:58,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:40:58,364 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:40:58,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:40:58,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:40:58,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:40:58,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:40:58,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:40:58,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:40:58,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:40:58,367 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:40:58,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:40:58,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:40:58,379 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:40:58,379 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:40:58,379 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:40:58,379 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:40:58,379 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:40:58,379 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:40:58,380 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:40:58,380 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:40:58,380 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:40:58,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:40:58,380 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:40:58,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:40:58,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:40:58,380 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:40:58,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:40:58,381 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:40:58,381 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:40:58,381 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:40:58,381 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:40:58,381 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:40:58,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:40:58,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:40:58,381 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:40:58,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:40:58,382 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:40:58,382 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:40:58,383 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:40:58,383 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eaca3e09b762fe94634aa0b3e6a04213782212a5 [2018-11-28 11:40:58,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:40:58,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:40:58,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:40:58,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:40:58,418 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:40:58,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-28 11:40:58,454 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/data/a05b41c22/756f5cb734154347a28931099f854a4f/FLAGe68d011e3 [2018-11-28 11:40:58,796 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:40:58,796 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-28 11:40:58,806 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/data/a05b41c22/756f5cb734154347a28931099f854a4f/FLAGe68d011e3 [2018-11-28 11:40:58,817 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/data/a05b41c22/756f5cb734154347a28931099f854a4f [2018-11-28 11:40:58,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:40:58,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:40:58,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:40:58,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:40:58,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:40:58,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:58" (1/1) ... [2018-11-28 11:40:58,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f881779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:58, skipping insertion in model container [2018-11-28 11:40:58,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:58" (1/1) ... [2018-11-28 11:40:58,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:40:58,855 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:40:59,043 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:40:59,092 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:40:59,125 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:40:59,157 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:40:59,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59 WrapperNode [2018-11-28 11:40:59,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:40:59,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:40:59,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:40:59,159 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:40:59,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:40:59,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:40:59,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:40:59,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:40:59,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... [2018-11-28 11:40:59,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:40:59,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:40:59,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:40:59,219 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:40:59,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:40:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:40:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:40:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:40:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:40:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:40:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:40:59,439 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:40:59,439 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:40:59,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:59 BoogieIcfgContainer [2018-11-28 11:40:59,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:40:59,440 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:40:59,440 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:40:59,442 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:40:59,443 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:40:59,443 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:40:58" (1/3) ... [2018-11-28 11:40:59,444 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2520d1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:40:59, skipping insertion in model container [2018-11-28 11:40:59,444 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:40:59,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:59" (2/3) ... [2018-11-28 11:40:59,445 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2520d1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:40:59, skipping insertion in model container [2018-11-28 11:40:59,445 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:40:59,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:59" (3/3) ... [2018-11-28 11:40:59,446 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcspn_true-termination.c.i [2018-11-28 11:40:59,483 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:40:59,483 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:40:59,484 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:40:59,484 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:40:59,484 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:40:59,484 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:40:59,484 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:40:59,484 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:40:59,484 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:40:59,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 11:40:59,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:40:59,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:59,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:59,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:40:59,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:40:59,515 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:40:59,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 11:40:59,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:40:59,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:59,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:59,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:40:59,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:40:59,523 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 12#L519true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L523true assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 18#L510-4true [2018-11-28 11:40:59,523 INFO L796 eck$LassoCheckResult]: Loop: 18#L510-4true call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 11#L510-1true assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 15#L511-4true assume !true; 19#L511-5true strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 16#L510-3true strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 18#L510-4true [2018-11-28 11:40:59,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 11:40:59,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:59,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:59,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash 44069891, now seen corresponding path program 1 times [2018-11-28 11:40:59,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:59,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:59,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:59,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:59,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:40:59,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:40:59,649 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:40:59,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:40:59,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:40:59,660 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-28 11:40:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:40:59,665 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-28 11:40:59,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:40:59,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-28 11:40:59,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:40:59,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 13 transitions. [2018-11-28 11:40:59,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 11:40:59,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:40:59,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-28 11:40:59,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:40:59,673 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 11:40:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-28 11:40:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-28 11:40:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:40:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-28 11:40:59,695 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 11:40:59,695 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 11:40:59,696 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:40:59,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-28 11:40:59,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:40:59,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:59,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:59,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:40:59,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:40:59,697 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 43#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 50#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 53#L510-4 [2018-11-28 11:40:59,697 INFO L796 eck$LassoCheckResult]: Loop: 53#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 48#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 49#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 44#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 45#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 52#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 53#L510-4 [2018-11-28 11:40:59,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-28 11:40:59,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:59,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:59,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:59,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1365737035, now seen corresponding path program 1 times [2018-11-28 11:40:59,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:59,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:59,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash 736220402, now seen corresponding path program 1 times [2018-11-28 11:40:59,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:59,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:59,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:00,068 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 11:41:00,145 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:41:00,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:41:00,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:41:00,146 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:41:00,146 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:41:00,146 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:41:00,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:41:00,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:41:00,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration2_Lasso [2018-11-28 11:41:00,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:41:00,147 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:41:00,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,379 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-11-28 11:41:00,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:00,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:41:00,770 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:41:00,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:00,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:00,773 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:41:00,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:00,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:00,778 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:41:00,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:00,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:00,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:00,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:00,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:00,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:00,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:00,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:00,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:00,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:00,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:00,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:00,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:00,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:00,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:00,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:00,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:00,841 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:41:00,862 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 11:41:00,862 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:41:00,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:41:00,865 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:41:00,865 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:41:00,866 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_strcspn_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2018-11-28 11:41:00,921 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 11:41:00,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:41:00,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:00,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:00,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:01,014 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 11:41:01,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-28 11:41:01,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 20 states and 23 transitions. Complement of second has 5 states. [2018-11-28 11:41:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:41:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:41:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 11:41:01,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 11:41:01,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:01,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 11:41:01,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:01,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 11:41:01,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:01,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-28 11:41:01,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:41:01,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 21 transitions. [2018-11-28 11:41:01,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 11:41:01,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:41:01,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 11:41:01,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:41:01,068 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 11:41:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 11:41:01,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 11:41:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 11:41:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 11:41:01,069 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 11:41:01,069 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 11:41:01,069 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:41:01,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-28 11:41:01,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:41:01,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:41:01,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:41:01,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:41:01,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:41:01,071 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 193#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 204#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 207#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 200#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 201#L511-4 [2018-11-28 11:41:01,071 INFO L796 eck$LassoCheckResult]: Loop: 201#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 194#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 195#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 205#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 201#L511-4 [2018-11-28 11:41:01,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-11-28 11:41:01,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:01,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:01,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:01,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 1 times [2018-11-28 11:41:01,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:01,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:01,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash 736222132, now seen corresponding path program 1 times [2018-11-28 11:41:01,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:01,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:01,338 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-28 11:41:01,411 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:41:01,411 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:41:01,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:41:01,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:41:01,411 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:41:01,411 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:41:01,411 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:41:01,411 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:41:01,411 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration3_Lasso [2018-11-28 11:41:01,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:41:01,412 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:41:01,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,614 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-28 11:41:01,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:01,877 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:41:01,877 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:41:01,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:01,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:01,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:01,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:01,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:01,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:01,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:01,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:01,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:01,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:01,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:01,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:01,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:01,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:01,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:01,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:01,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:01,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:01,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:01,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:01,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:01,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:01,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:01,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:01,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:01,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:01,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:01,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,902 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:41:01,902 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 11:41:01,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,912 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-28 11:41:01,912 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 11:41:01,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:01,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:01,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:01,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:01,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:01,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:01,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:01,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:01,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:01,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:01,961 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:41:01,973 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:41:01,973 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:41:01,974 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:41:01,974 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:41:01,974 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:41:01,974 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~reject.offset, ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2) = -1*ULTIMATE.start_strcspn_~reject.offset - 1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2 Supporting invariants [] [2018-11-28 11:41:02,030 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 11:41:02,031 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:41:02,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:02,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:02,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:02,089 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:41:02,089 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 11:41:02,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 45 states and 51 transitions. Complement of second has 5 states. [2018-11-28 11:41:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:41:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:41:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 11:41:02,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 11:41:02,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:02,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 11:41:02,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:02,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 11:41:02,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:02,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2018-11-28 11:41:02,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:41:02,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 33 transitions. [2018-11-28 11:41:02,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:41:02,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:41:02,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-28 11:41:02,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:41:02,107 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-28 11:41:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-28 11:41:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-28 11:41:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 11:41:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-28 11:41:02,109 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 11:41:02,109 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 11:41:02,109 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:41:02,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-28 11:41:02,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:41:02,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:41:02,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:41:02,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:02,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:41:02,110 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 371#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 381#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 384#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 379#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 380#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 393#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 392#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 387#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 388#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 377#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 378#L511-4 [2018-11-28 11:41:02,110 INFO L796 eck$LassoCheckResult]: Loop: 378#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 372#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 373#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 382#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 378#L511-4 [2018-11-28 11:41:02,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:02,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1161797001, now seen corresponding path program 2 times [2018-11-28 11:41:02,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:02,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:02,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:02,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:02,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 2 times [2018-11-28 11:41:02,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:02,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:02,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:02,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash -967302850, now seen corresponding path program 1 times [2018-11-28 11:41:02,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:02,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:02,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:02,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b44a018-134f-4488-a779-3aca0bd27f89/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:41:02,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:02,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:02,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 11:41:02,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:41:02,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-28 11:41:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:02,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:02,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 11:41:02,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:41:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:41:02,428 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 13 states. [2018-11-28 11:41:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:02,492 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 11:41:02,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:41:02,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2018-11-28 11:41:02,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:41:02,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 39 transitions. [2018-11-28 11:41:02,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:41:02,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:41:02,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2018-11-28 11:41:02,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:41:02,495 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-28 11:41:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2018-11-28 11:41:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-28 11:41:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 11:41:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-28 11:41:02,497 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 11:41:02,497 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 11:41:02,497 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:41:02,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-28 11:41:02,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:41:02,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:41:02,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:41:02,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:02,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:41:02,499 INFO L794 eck$LassoCheckResult]: Stem: 513#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 508#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 518#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 522#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 516#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 517#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 511#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 512#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 520#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 521#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 527#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 526#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 523#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 524#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 514#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 515#L511-4 [2018-11-28 11:41:02,499 INFO L796 eck$LassoCheckResult]: Loop: 515#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 509#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 510#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 519#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 515#L511-4 [2018-11-28 11:41:02,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:02,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1375356158, now seen corresponding path program 2 times [2018-11-28 11:41:02,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:02,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:02,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:02,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 3 times [2018-11-28 11:41:02,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:02,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:02,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1858115515, now seen corresponding path program 3 times [2018-11-28 11:41:02,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:02,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:02,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:02,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:03,031 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 138 [2018-11-28 11:41:03,120 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:41:03,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:41:03,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:41:03,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:41:03,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:41:03,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:41:03,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:41:03,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:41:03,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration5_Lasso [2018-11-28 11:41:03,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:41:03,121 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:41:03,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,448 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-11-28 11:41:03,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:03,854 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-28 11:41:03,946 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:41:03,946 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:41:03,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:03,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:03,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:03,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:03,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:03,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:03,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:03,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:03,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:41:03,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:41:03,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:41:03,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:03,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:03,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:03,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:03,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:03,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,989 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:41:03,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:03,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:03,990 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:41:03,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:03,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:03,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:03,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:03,995 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-28 11:41:03,995 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 11:41:03,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:04,006 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-11-28 11:41:04,007 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 11:41:04,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:04,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:04,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:04,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:04,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:04,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:04,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:04,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:04,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:04,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:04,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:04,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:04,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:04,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:04,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:04,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:04,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:41:04,105 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 11:41:04,105 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 11:41:04,106 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:41:04,106 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:41:04,106 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:41:04,107 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3) = -2*ULTIMATE.start_strcspn_~i~0 + 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 Supporting invariants [] [2018-11-28 11:41:04,222 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-11-28 11:41:04,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:41:04,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:04,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:04,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:04,312 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-28 11:41:04,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 11:41:04,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2018-11-28 11:41:04,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 11:41:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:41:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 11:41:04,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 11:41:04,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:04,350 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:41:04,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:04,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:04,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:04,423 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-28 11:41:04,423 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 11:41:04,446 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2018-11-28 11:41:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 11:41:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:41:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 11:41:04,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 11:41:04,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:04,447 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:41:04,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:04,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:04,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:04,525 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-28 11:41:04,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 11:41:04,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 56 states and 63 transitions. Complement of second has 11 states. [2018-11-28 11:41:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-28 11:41:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:41:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-28 11:41:04,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 11:41:04,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:04,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-28 11:41:04,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:04,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-28 11:41:04,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:04,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2018-11-28 11:41:04,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:41:04,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 46 transitions. [2018-11-28 11:41:04,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:41:04,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:41:04,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-11-28 11:41:04,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:41:04,611 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-28 11:41:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-11-28 11:41:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-11-28 11:41:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 11:41:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 11:41:04,613 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 11:41:04,613 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 11:41:04,613 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:41:04,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-11-28 11:41:04,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:41:04,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:41:04,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:41:04,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 11:41:04,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:41:04,615 INFO L794 eck$LassoCheckResult]: Stem: 1044#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1038#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 1039#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1049#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 1053#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1058#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1069#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1066#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1068#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1067#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1065#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1064#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1063#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1054#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1055#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1047#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1048#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1042#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1043#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1051#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1052#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1070#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1059#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1060#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1061#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1045#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1046#L511-4 [2018-11-28 11:41:04,615 INFO L796 eck$LassoCheckResult]: Loop: 1046#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1040#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1041#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1050#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1046#L511-4 [2018-11-28 11:41:04,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1550213327, now seen corresponding path program 4 times [2018-11-28 11:41:04,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:04,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:04,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:04,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:04,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 4 times [2018-11-28 11:41:04,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:04,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:04,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:04,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:04,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:04,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash 229061526, now seen corresponding path program 5 times [2018-11-28 11:41:04,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:04,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:41:05,176 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 171 [2018-11-28 11:41:05,278 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:41:05,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:41:05,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:41:05,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:41:05,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:41:05,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:41:05,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:41:05,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:41:05,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration6_Lasso [2018-11-28 11:41:05,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:41:05,278 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:41:05,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,582 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-28 11:41:05,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:41:05,834 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:41:06,615 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-11-28 11:41:06,648 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:41:06,648 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:41:06,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:06,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:06,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:06,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:06,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:06,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:06,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:06,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:06,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:06,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:06,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:06,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:06,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:06,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:06,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:06,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:06,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:06,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:06,655 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:41:06,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:06,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:06,656 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:41:06,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:06,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:06,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:06,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:06,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:06,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:06,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:06,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:06,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:06,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:41:06,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:41:06,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:41:06,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:41:06,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:41:06,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:41:06,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:41:06,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:41:06,686 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:41:06,703 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:41:06,703 INFO L444 ModelExtractionUtils]: 39 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 11:41:06,703 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:41:06,704 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:41:06,704 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:41:06,704 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, ULTIMATE.start_strcspn_~reject.offset, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4) = -1*ULTIMATE.start_strcspn_~i~0 - 1*ULTIMATE.start_strcspn_~reject.offset + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 Supporting invariants [] [2018-11-28 11:41:06,812 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-28 11:41:06,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:41:06,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:06,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:06,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:06,842 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:41:06,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 11:41:06,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 45 states and 50 transitions. Complement of second has 5 states. [2018-11-28 11:41:06,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:41:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:41:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 11:41:06,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-28 11:41:06,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:06,853 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:41:06,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:06,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:06,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:06,890 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:41:06,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 11:41:06,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 45 states and 50 transitions. Complement of second has 5 states. [2018-11-28 11:41:06,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:41:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:41:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 11:41:06,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-28 11:41:06,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:06,900 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:41:06,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:06,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:06,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:06,931 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:41:06,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 11:41:06,940 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 62 states and 71 transitions. Complement of second has 4 states. [2018-11-28 11:41:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:41:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:41:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-28 11:41:06,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-28 11:41:06,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:06,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 30 letters. Loop has 4 letters. [2018-11-28 11:41:06,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:06,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 8 letters. [2018-11-28 11:41:06,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:41:06,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2018-11-28 11:41:06,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:41:06,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 0 states and 0 transitions. [2018-11-28 11:41:06,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:41:06,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:41:06,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:41:06,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:41:06,945 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:41:06,945 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:41:06,945 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:41:06,945 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:41:06,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:41:06,945 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:41:06,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:41:06,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:41:06 BoogieIcfgContainer [2018-11-28 11:41:06,950 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:41:06,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:41:06,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:41:06,950 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:41:06,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:59" (3/4) ... [2018-11-28 11:41:06,953 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:41:06,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:41:06,954 INFO L168 Benchmark]: Toolchain (without parser) took 8134.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 121.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:06,954 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:41:06,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:06,955 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.90 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:06,955 INFO L168 Benchmark]: Boogie Preprocessor took 21.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:41:06,956 INFO L168 Benchmark]: RCFGBuilder took 221.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:06,956 INFO L168 Benchmark]: BuchiAutomizer took 7510.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:41:06,956 INFO L168 Benchmark]: Witness Printer took 2.94 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:41:06,958 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.90 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 221.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7510.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.94 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 4 locations. One deterministic module has affine ranking function -1 * reject + -1 * i + unknown-#length-unknown[reject] and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i + -1 * reject + unknown-#length-unknown[reject] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 168 SDslu, 100 SDs, 0 SdLazy, 136 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax100 hnf99 lsp94 ukn78 mio100 lsp37 div100 bol100 ite100 ukn100 eq183 hnf89 smp96 dnf466 smp77 tf100 neg91 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 136 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...