./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/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_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/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-635dfa2 [2018-12-02 02:54:05,394 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:54:05,395 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:54:05,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:54:05,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:54:05,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:54:05,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:54:05,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:54:05,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:54:05,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:54:05,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:54:05,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:54:05,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:54:05,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:54:05,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:54:05,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:54:05,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:54:05,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:54:05,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:54:05,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:54:05,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:54:05,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:54:05,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:54:05,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:54:05,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:54:05,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:54:05,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:54:05,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:54:05,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:54:05,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:54:05,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:54:05,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:54:05,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:54:05,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:54:05,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:54:05,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:54:05,418 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 02:54:05,430 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:54:05,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:54:05,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:54:05,431 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:54:05,431 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:54:05,432 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 02:54:05,432 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 02:54:05,432 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 02:54:05,432 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 02:54:05,432 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 02:54:05,432 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 02:54:05,432 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:54:05,433 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:54:05,433 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:54:05,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:54:05,433 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 02:54:05,433 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 02:54:05,433 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 02:54:05,434 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:54:05,434 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 02:54:05,434 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:54:05,434 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 02:54:05,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:54:05,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:54:05,434 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 02:54:05,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:54:05,435 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:54:05,435 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 02:54:05,436 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 02:54:05,436 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_34e72103-6268-414b-bc0f-0973d2a08dd1/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-12-02 02:54:05,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:54:05,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:54:05,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:54:05,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:54:05,469 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:54:05,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-12-02 02:54:05,508 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/data/fb6b4aaa2/0120e8ef92994538ab527e5b268cdcdc/FLAGd503c8189 [2018-12-02 02:54:05,972 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:54:05,973 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-12-02 02:54:05,978 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/data/fb6b4aaa2/0120e8ef92994538ab527e5b268cdcdc/FLAGd503c8189 [2018-12-02 02:54:05,986 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/data/fb6b4aaa2/0120e8ef92994538ab527e5b268cdcdc [2018-12-02 02:54:05,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:54:05,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:54:05,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:54:05,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:54:05,991 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:54:05,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:54:05" (1/1) ... [2018-12-02 02:54:05,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663cdbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:05, skipping insertion in model container [2018-12-02 02:54:05,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:54:05" (1/1) ... [2018-12-02 02:54:05,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:54:06,013 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:54:06,157 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:54:06,163 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:54:06,222 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:54:06,241 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:54:06,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06 WrapperNode [2018-12-02 02:54:06,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:54:06,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:54:06,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:54:06,242 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:54:06,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:54:06,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:54:06,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:54:06,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:54:06,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... [2018-12-02 02:54:06,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:54:06,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:54:06,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:54:06,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:54:06,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:54:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:54:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:54:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:54:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:54:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:54:06,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:54:06,441 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:54:06,441 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 02:54:06,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:54:06 BoogieIcfgContainer [2018-12-02 02:54:06,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:54:06,442 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 02:54:06,442 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 02:54:06,444 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 02:54:06,445 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:54:06,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:54:05" (1/3) ... [2018-12-02 02:54:06,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b52418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:54:06, skipping insertion in model container [2018-12-02 02:54:06,446 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:54:06,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:06" (2/3) ... [2018-12-02 02:54:06,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b52418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:54:06, skipping insertion in model container [2018-12-02 02:54:06,446 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:54:06,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:54:06" (3/3) ... [2018-12-02 02:54:06,447 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcspn_true-termination.c.i [2018-12-02 02:54:06,480 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:54:06,481 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 02:54:06,481 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 02:54:06,481 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 02:54:06,481 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:54:06,481 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:54:06,481 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 02:54:06,481 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:54:06,481 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 02:54:06,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 02:54:06,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 02:54:06,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:54:06,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:54:06,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 02:54:06,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 02:54:06,508 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 02:54:06,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 02:54:06,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 02:54:06,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:54:06,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:54:06,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 02:54:06,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 02:54:06,514 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-12-02 02:54:06,514 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-12-02 02:54:06,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-02 02:54:06,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:06,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:06,603 INFO L82 PathProgramCache]: Analyzing trace with hash 44069891, now seen corresponding path program 1 times [2018-12-02 02:54:06,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:06,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:06,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:06,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:06,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:06,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:54:06,624 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:54:06,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 02:54:06,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 02:54:06,635 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-12-02 02:54:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:06,639 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-02 02:54:06,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 02:54:06,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-12-02 02:54:06,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 02:54:06,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 13 transitions. [2018-12-02 02:54:06,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 02:54:06,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 02:54:06,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-12-02 02:54:06,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:54:06,644 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-02 02:54:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-12-02 02:54:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-02 02:54:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 02:54:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-02 02:54:06,660 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-02 02:54:06,660 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-02 02:54:06,660 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 02:54:06,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-12-02 02:54:06,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 02:54:06,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:54:06,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:54:06,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 02:54:06,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 02:54:06,661 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-12-02 02:54:06,661 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-12-02 02:54:06,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-12-02 02:54:06,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:06,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:06,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:06,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:06,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1365737035, now seen corresponding path program 1 times [2018-12-02 02:54:06,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:06,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:54:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:06,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 736220402, now seen corresponding path program 1 times [2018-12-02 02:54:06,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:06,954 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-12-02 02:54:07,016 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:54:07,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:54:07,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:54:07,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:54:07,017 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:54:07,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:54:07,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:54:07,017 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:54:07,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration2_Lasso [2018-12-02 02:54:07,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:54:07,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:54:07,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,211 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-12-02 02:54:07,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,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-12-02 02:54:07,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:07,545 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:54:07,548 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:54:07,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:07,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:07,551 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:54:07,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:07,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:07,555 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:54:07,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:07,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:07,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:07,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:07,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:07,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:07,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:07,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:07,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:07,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:07,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:07,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:07,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:07,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:07,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:07,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:07,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:07,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:54:07,616 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 02:54:07,617 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 02:54:07,618 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:54:07,619 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:54:07,620 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:54:07,620 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-12-02 02:54:07,657 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-02 02:54:07,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 02:54:07,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:07,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:07,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:07,735 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 02:54:07,736 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-12-02 02:54:07,782 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-12-02 02:54:07,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 02:54:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 02:54:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-02 02:54:07,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-02 02:54:07,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:07,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-02 02:54:07,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:07,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-12-02 02:54:07,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:07,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-12-02 02:54:07,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 02:54:07,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 21 transitions. [2018-12-02 02:54:07,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 02:54:07,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 02:54:07,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-02 02:54:07,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:54:07,788 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 02:54:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-02 02:54:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 02:54:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 02:54:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-02 02:54:07,789 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 02:54:07,789 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 02:54:07,790 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 02:54:07,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-12-02 02:54:07,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 02:54:07,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:54:07,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:54:07,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 02:54:07,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 02:54:07,791 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-12-02 02:54:07,791 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~mem4;havoc strcspn_#t~mem5; 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-12-02 02:54:07,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:07,791 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-12-02 02:54:07,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:07,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:07,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:07,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:07,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:07,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 1 times [2018-12-02 02:54:07,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:07,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:07,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:07,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:07,819 INFO L82 PathProgramCache]: Analyzing trace with hash 736222132, now seen corresponding path program 1 times [2018-12-02 02:54:07,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:07,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:07,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:08,067 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-12-02 02:54:08,143 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:54:08,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:54:08,143 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:54:08,143 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:54:08,143 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:54:08,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:54:08,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:54:08,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:54:08,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration3_Lasso [2018-12-02 02:54:08,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:54:08,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:54:08,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-12-02 02:54:08,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:08,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:54:08,555 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:54:08,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:08,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:08,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:08,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:08,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:08,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:08,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:08,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:08,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:08,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:08,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:08,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:08,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:08,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:08,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:08,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:08,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:08,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:08,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:08,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:08,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:08,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:08,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:08,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:08,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:08,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:08,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:08,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,572 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:54:08,572 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-02 02:54:08,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,577 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-12-02 02:54:08,577 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-02 02:54:08,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:08,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:08,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:08,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:08,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:08,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:08,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:08,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:08,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:08,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:08,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:54:08,619 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 02:54:08,620 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 02:54:08,620 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:54:08,620 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:54:08,621 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:54:08,621 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-12-02 02:54:08,664 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-12-02 02:54:08,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 02:54:08,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:08,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:08,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:08,695 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-12-02 02:54:08,695 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 02:54:08,708 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-12-02 02:54:08,709 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-12-02 02:54:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 02:54:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-02 02:54:08,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 02:54:08,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:08,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 02:54:08,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:08,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-02 02:54:08,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:08,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2018-12-02 02:54:08,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 02:54:08,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 33 transitions. [2018-12-02 02:54:08,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 02:54:08,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 02:54:08,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-12-02 02:54:08,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:54:08,711 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 02:54:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-12-02 02:54:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-12-02 02:54:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 02:54:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-02 02:54:08,712 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 02:54:08,712 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 02:54:08,712 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 02:54:08,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-12-02 02:54:08,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 02:54:08,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:54:08,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:54:08,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:08,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 02:54:08,713 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-12-02 02:54:08,713 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~mem4;havoc strcspn_#t~mem5; 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-12-02 02:54:08,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:08,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1161797001, now seen corresponding path program 2 times [2018-12-02 02:54:08,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:08,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:08,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:08,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:08,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 2 times [2018-12-02 02:54:08,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:08,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:08,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:54:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:08,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:08,729 INFO L82 PathProgramCache]: Analyzing trace with hash -967302850, now seen corresponding path program 1 times [2018-12-02 02:54:08,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:08,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:54:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:08,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:54:08,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e72103-6268-414b-bc0f-0973d2a08dd1/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-12-02 02:54:08,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:08,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:08,893 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-12-02 02:54:08,895 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-12-02 02:54:08,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:08,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:08,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:08,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 02:54:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:08,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:54:08,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-12-02 02:54:08,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:54:08,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:54:08,959 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 13 states. [2018-12-02 02:54:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:09,011 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-02 02:54:09,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:54:09,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2018-12-02 02:54:09,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 02:54:09,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 39 transitions. [2018-12-02 02:54:09,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 02:54:09,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 02:54:09,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2018-12-02 02:54:09,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:54:09,014 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-12-02 02:54:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2018-12-02 02:54:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-02 02:54:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 02:54:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-12-02 02:54:09,016 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-12-02 02:54:09,016 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-12-02 02:54:09,016 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 02:54:09,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-12-02 02:54:09,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 02:54:09,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:54:09,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:54:09,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:09,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 02:54:09,017 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~mem4;havoc strcspn_#t~mem5; 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-12-02 02:54:09,017 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~mem4;havoc strcspn_#t~mem5; 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-12-02 02:54:09,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1375356158, now seen corresponding path program 2 times [2018-12-02 02:54:09,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:09,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:09,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:09,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:09,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:09,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 3 times [2018-12-02 02:54:09,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:09,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:09,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:54:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:09,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1858115515, now seen corresponding path program 3 times [2018-12-02 02:54:09,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:09,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:09,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:54:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:09,455 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 138 [2018-12-02 02:54:09,552 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:54:09,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:54:09,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:54:09,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:54:09,552 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:54:09,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:54:09,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:54:09,552 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:54:09,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration5_Lasso [2018-12-02 02:54:09,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:54:09,552 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:54:09,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:09,891 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-12-02 02:54:09,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:10,281 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-12-02 02:54:10,372 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:54:10,372 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:54:10,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:10,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:10,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:10,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:10,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:54:10,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:54:10,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:54:10,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:10,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:10,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,395 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:54:10,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,396 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:54:10,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,399 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-02 02:54:10,399 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-02 02:54:10,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,406 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-12-02 02:54:10,406 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-02 02:54:10,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:10,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:10,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:10,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:10,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:10,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:10,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:10,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:10,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:10,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:54:10,469 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 02:54:10,469 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 02:54:10,469 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:54:10,470 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:54:10,470 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:54:10,470 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3, ULTIMATE.start_strcspn_~i~0) = 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 - 2*ULTIMATE.start_strcspn_~i~0 Supporting invariants [] [2018-12-02 02:54:10,546 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-12-02 02:54:10,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 02:54:10,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:10,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:10,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:10,630 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-12-02 02:54:10,630 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-02 02:54:10,653 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-12-02 02:54:10,653 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-12-02 02:54:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 02:54:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-02 02:54:10,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-02 02:54:10,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:10,654 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 02:54:10,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:10,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:10,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:10,726 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-12-02 02:54:10,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-02 02:54:10,750 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-12-02 02:54:10,750 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-12-02 02:54:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 02:54:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-02 02:54:10,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-02 02:54:10,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:10,751 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 02:54:10,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:10,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:10,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:10,837 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-12-02 02:54:10,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-02 02:54:10,900 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-12-02 02:54:10,900 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-12-02 02:54:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 02:54:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-12-02 02:54:10,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-02 02:54:10,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:10,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 20 letters. Loop has 4 letters. [2018-12-02 02:54:10,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:10,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 8 letters. [2018-12-02 02:54:10,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:10,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2018-12-02 02:54:10,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 02:54:10,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 46 transitions. [2018-12-02 02:54:10,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 02:54:10,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 02:54:10,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-12-02 02:54:10,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 02:54:10,902 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-02 02:54:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-12-02 02:54:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-12-02 02:54:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 02:54:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 02:54:10,904 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 02:54:10,904 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 02:54:10,904 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 02:54:10,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-12-02 02:54:10,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 02:54:10,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:54:10,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:54:10,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-02 02:54:10,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 02:54:10,905 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~mem4;havoc strcspn_#t~mem5; 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~mem4;havoc strcspn_#t~mem5; 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-12-02 02:54:10,905 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~mem4;havoc strcspn_#t~mem5; 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-12-02 02:54:10,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1550213327, now seen corresponding path program 4 times [2018-12-02 02:54:10,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:10,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:10,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:54:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:10,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:10,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 4 times [2018-12-02 02:54:10,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:10,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:10,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:10,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:54:10,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:10,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:10,928 INFO L82 PathProgramCache]: Analyzing trace with hash 229061526, now seen corresponding path program 5 times [2018-12-02 02:54:10,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:54:10,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:54:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:10,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:54:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:54:11,476 WARN L180 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 171 [2018-12-02 02:54:11,573 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:54:11,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:54:11,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:54:11,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:54:11,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:54:11,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:54:11,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:54:11,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:54:11,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration6_Lasso [2018-12-02 02:54:11,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:54:11,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:54:11,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,864 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-02 02:54:11,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:11,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:54:12,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 02:54:12,926 WARN L180 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-12-02 02:54:12,967 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:54:12,967 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:54:12,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-12-02 02:54:12,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:12,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:12,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:12,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:12,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:12,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:12,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:12,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:12,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:12,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:12,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:12,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:12,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:12,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:12,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:12,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-12-02 02:54:12,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:12,973 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 02:54:12,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:12,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:12,974 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:54:12,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:12,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:12,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:12,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:12,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:12,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:12,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:12,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:12,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:12,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:54:12,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:54:12,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:54:12,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:54:12,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:54:12,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:54:12,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:54:12,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 02:54:13,000 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 02:54:13,011 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 02:54:13,011 INFO L444 ModelExtractionUtils]: 39 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 02:54:13,012 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 02:54:13,012 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 02:54:13,012 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 02:54:13,012 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-12-02 02:54:13,113 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-12-02 02:54:13,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 02:54:13,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:13,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:13,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:13,142 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-12-02 02:54:13,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 02:54:13,151 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-12-02 02:54:13,151 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-12-02 02:54:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 02:54:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-02 02:54:13,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-12-02 02:54:13,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:13,152 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 02:54:13,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:13,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:13,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:13,181 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-12-02 02:54:13,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 02:54:13,187 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-12-02 02:54:13,187 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-12-02 02:54:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 02:54:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-02 02:54:13,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-12-02 02:54:13,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:13,188 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 02:54:13,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:13,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:13,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:13,220 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-12-02 02:54:13,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 02:54:13,230 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-12-02 02:54:13,231 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-12-02 02:54:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 02:54:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-02 02:54:13,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 4 letters. [2018-12-02 02:54:13,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:13,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 30 letters. Loop has 4 letters. [2018-12-02 02:54:13,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:13,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 8 letters. [2018-12-02 02:54:13,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 02:54:13,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2018-12-02 02:54:13,233 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 02:54:13,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 0 states and 0 transitions. [2018-12-02 02:54:13,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 02:54:13,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 02:54:13,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 02:54:13,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:54:13,234 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:54:13,234 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:54:13,234 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:54:13,234 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 02:54:13,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:54:13,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 02:54:13,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 02:54:13,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:54:13 BoogieIcfgContainer [2018-12-02 02:54:13,238 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 02:54:13,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:54:13,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:54:13,238 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:54:13,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:54:06" (3/4) ... [2018-12-02 02:54:13,241 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 02:54:13,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:54:13,241 INFO L168 Benchmark]: Toolchain (without parser) took 7252.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -109.2 MB). Peak memory consumption was 233.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:54:13,242 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:54:13,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -124.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:54:13,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:54:13,242 INFO L168 Benchmark]: Boogie Preprocessor took 15.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:54:13,242 INFO L168 Benchmark]: RCFGBuilder took 158.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:54:13,243 INFO L168 Benchmark]: BuchiAutomizer took 6795.99 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.5 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. [2018-12-02 02:54:13,243 INFO L168 Benchmark]: Witness Printer took 2.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:54:13,245 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -124.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 158.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6795.99 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.5 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.74 ms. Allocated memory is still 1.4 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 3 * unknown-#length-unknown[reject] + -2 * i 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 6.7s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 5.9s. Construction of modules took 0.0s. 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.0s 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: 40ms 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...