./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/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 1697f909ede7c89de56057e54b84d7ae7cf0bcac .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:59:57,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:59:57,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:59:57,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:59:57,060 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:59:57,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:59:57,062 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:59:57,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:59:57,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:59:57,065 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:59:57,066 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:59:57,066 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:59:57,067 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:59:57,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:59:57,069 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:59:57,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:59:57,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:59:57,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:59:57,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:59:57,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:59:57,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:59:57,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:59:57,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:59:57,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:59:57,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:59:57,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:59:57,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:59:57,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:59:57,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:59:57,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:59:57,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:59:57,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:59:57,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:59:57,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:59:57,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:59:57,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:59:57,086 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:59:57,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:59:57,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:59:57,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:59:57,102 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:59:57,102 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:59:57,102 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:59:57,102 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:59:57,102 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:59:57,102 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:59:57,103 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:59:57,103 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:59:57,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:59:57,103 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:59:57,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:59:57,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:59:57,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:59:57,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:59:57,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:59:57,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:59:57,104 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:59:57,104 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:59:57,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:59:57,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:59:57,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:59:57,105 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:59:57,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:59:57,105 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:59:57,105 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:59:57,106 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:59:57,106 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_f9d0eeed-921f-48ef-9e5a-1948674e9c99/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 -> 1697f909ede7c89de56057e54b84d7ae7cf0bcac [2018-11-28 12:59:57,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:59:57,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:59:57,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:59:57,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:59:57,144 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:59:57,145 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-11-28 12:59:57,190 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/data/bd9c0d2aa/ac53e933f5ae4901a21d49712326d085/FLAGb022709cd [2018-11-28 12:59:57,578 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:59:57,578 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-11-28 12:59:57,586 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/data/bd9c0d2aa/ac53e933f5ae4901a21d49712326d085/FLAGb022709cd [2018-11-28 12:59:57,957 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/data/bd9c0d2aa/ac53e933f5ae4901a21d49712326d085 [2018-11-28 12:59:57,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:59:57,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:59:57,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:59:57,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:59:57,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:59:57,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:59:57" (1/1) ... [2018-11-28 12:59:57,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23027034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:57, skipping insertion in model container [2018-11-28 12:59:57,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:59:57" (1/1) ... [2018-11-28 12:59:57,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:59:58,007 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:59:58,234 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:59:58,246 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:59:58,354 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:59:58,397 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:59:58,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58 WrapperNode [2018-11-28 12:59:58,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:59:58,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:59:58,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:59:58,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:59:58,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:59:58,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:59:58,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:59:58,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:59:58,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... [2018-11-28 12:59:58,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:59:58,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:59:58,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:59:58,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:59:58,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:59:58,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:59:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:59:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:59:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:59:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:59:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:59:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 12:59:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:59:58,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:59:58,916 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:59:58,917 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-28 12:59:58,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:59:58 BoogieIcfgContainer [2018-11-28 12:59:58,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:59:58,918 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:59:58,918 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:59:58,921 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:59:58,922 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:59:58,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:59:57" (1/3) ... [2018-11-28 12:59:58,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d7ec7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:59:58, skipping insertion in model container [2018-11-28 12:59:58,922 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:59:58,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:59:58" (2/3) ... [2018-11-28 12:59:58,923 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d7ec7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:59:58, skipping insertion in model container [2018-11-28 12:59:58,923 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:59:58,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:59:58" (3/3) ... [2018-11-28 12:59:58,924 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtok_r_true-termination.c.i [2018-11-28 12:59:58,963 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:59:58,963 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:59:58,963 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:59:58,964 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:59:58,964 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:59:58,964 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:59:58,964 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:59:58,964 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:59:58,964 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:59:58,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-28 12:59:58,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 12:59:58,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:59:58,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:59:58,998 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:59:58,998 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:59:58,998 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:59:58,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-28 12:59:59,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 12:59:59,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:59:59,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:59:59,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:59:59,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:59:59,006 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 7#L544true assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 3#L548true assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 9#L532true assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0;call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8);strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset; 12#L532-2true strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 20#L510-4true [2018-11-28 12:59:59,006 INFO L796 eck$LassoCheckResult]: Loop: 20#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 11#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 21#L511-6true assume !true; 22#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 25#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 16#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 20#L510-4true [2018-11-28 12:59:59,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 1 times [2018-11-28 12:59:59,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:59,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:59,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:59:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:59:59,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:59:59,162 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:59:59,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1573281738, now seen corresponding path program 1 times [2018-11-28 12:59:59,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:59,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:59,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:59,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:59:59,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:59:59,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:59:59,173 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:59:59,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:59:59,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:59:59,193 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-28 12:59:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:59:59,201 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-11-28 12:59:59,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:59:59,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2018-11-28 12:59:59,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 12:59:59,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 26 states and 32 transitions. [2018-11-28 12:59:59,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 12:59:59,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 12:59:59,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-28 12:59:59,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:59:59,212 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 12:59:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-28 12:59:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 12:59:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 12:59:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-28 12:59:59,243 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 12:59:59,243 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 12:59:59,243 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:59:59,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-28 12:59:59,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 12:59:59,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:59:59,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:59:59,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:59:59,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:59:59,245 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 86#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 85#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 78#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 79#L532 assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0;call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8);strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset; 87#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 92#L510-4 [2018-11-28 12:59:59,245 INFO L796 eck$LassoCheckResult]: Loop: 92#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 90#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 91#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 96#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 101#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 97#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 98#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 94#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 92#L510-4 [2018-11-28 12:59:59,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:59,246 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 2 times [2018-11-28 12:59:59,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:59,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:59:59,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:59:59,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:59:59,294 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:59:59,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 1 times [2018-11-28 12:59:59,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:59,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:59:59,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:59,472 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-28 12:59:59,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:59:59,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:59:59,516 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 12:59:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:59:59,553 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-28 12:59:59,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:59:59,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-28 12:59:59,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 12:59:59,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 31 transitions. [2018-11-28 12:59:59,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 12:59:59,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 12:59:59,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-28 12:59:59,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:59:59,556 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 12:59:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-28 12:59:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 12:59:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 12:59:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-28 12:59:59,558 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 12:59:59,558 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 12:59:59,558 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:59:59,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-28 12:59:59,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 12:59:59,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:59:59,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:59:59,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:59:59,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:59:59,560 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 146#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 139#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 140#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 148#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 153#L510-4 [2018-11-28 12:59:59,560 INFO L796 eck$LassoCheckResult]: Loop: 153#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 151#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 152#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 157#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 162#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 158#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 159#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 155#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 153#L510-4 [2018-11-28 12:59:59,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2018-11-28 12:59:59,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:59,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:59,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 2 times [2018-11-28 12:59:59,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:59,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:59,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash -126923364, now seen corresponding path program 1 times [2018-11-28 12:59:59,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:59,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:59,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:59:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:59:59,791 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-28 13:00:00,302 WARN L180 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 142 [2018-11-28 13:00:00,501 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-28 13:00:00,510 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:00:00,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:00:00,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:00:00,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:00:00,511 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:00:00,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:00:00,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:00:00,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:00:00,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration3_Lasso [2018-11-28 13:00:00,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:00:00,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:00:00,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,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-11-28 13:00:00,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-11-28 13:00:00,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:00,976 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2018-11-28 13:00:01,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:01,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:00:01,457 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:00:01,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,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-11-28 13:00:01,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,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-11-28 13:00:01,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,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-11-28 13:00:01,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,581 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:00:01,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,582 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:00:01,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:01,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:01,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:01,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,636 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:01,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,639 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:01,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:01,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:01,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:01,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:01,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:01,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:01,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:01,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:01,699 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:00:01,720 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:00:01,721 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 13:00:01,722 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:00:01,724 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:00:01,724 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:00:01,724 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2018-11-28 13:00:01,775 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-11-28 13:00:01,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:00:01,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:01,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:01,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:01,887 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 13:00:01,888 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 13:00:01,966 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 46 states and 57 transitions. Complement of second has 6 states. [2018-11-28 13:00:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:00:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-28 13:00:01,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 13:00:01,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:01,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-28 13:00:01,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:01,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 16 letters. [2018-11-28 13:00:01,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:01,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-11-28 13:00:01,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:00:01,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 42 transitions. [2018-11-28 13:00:01,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 13:00:01,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 13:00:01,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-11-28 13:00:01,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:01,975 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-28 13:00:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-11-28 13:00:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-28 13:00:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 13:00:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-28 13:00:01,977 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-28 13:00:01,977 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-28 13:00:01,977 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:00:01,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-28 13:00:01,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:00:01,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:01,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:01,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:01,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:01,979 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 341#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 340#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 333#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 334#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 342#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 349#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 345#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 346#L511-6 [2018-11-28 13:00:01,979 INFO L796 eck$LassoCheckResult]: Loop: 346#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 354#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 362#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 365#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 346#L511-6 [2018-11-28 13:00:01,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 179564655, now seen corresponding path program 1 times [2018-11-28 13:00:01,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:01,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:02,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 1 times [2018-11-28 13:00:02,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:02,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:02,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:02,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:02,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1251527276, now seen corresponding path program 1 times [2018-11-28 13:00:02,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:02,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:02,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:02,635 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 155 [2018-11-28 13:00:02,846 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-11-28 13:00:02,848 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:00:02,848 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:00:02,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:00:02,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:00:02,848 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:00:02,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:00:02,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:00:02,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:00:02,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration4_Lasso [2018-11-28 13:00:02,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:00:02,848 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:00:02,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:02,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,255 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-11-28 13:00:03,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,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-11-28 13:00:03,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,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-11-28 13:00:03,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:03,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-11-28 13:00:03,564 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-28 13:00:03,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:00:03,875 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:00:03,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,925 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:03,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,927 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:03,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,948 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:03,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,949 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:03,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:03,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:03,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:03,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:03,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:03,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:03,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:03,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:03,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:03,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:03,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:03,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:04,003 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:00:04,015 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:00:04,015 INFO L444 ModelExtractionUtils]: 60 out of 64 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:00:04,015 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:00:04,016 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:00:04,016 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:00:04,017 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2 Supporting invariants [] [2018-11-28 13:00:04,098 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-11-28 13:00:04,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:00:04,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:04,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:04,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:04,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 13:00:04,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-28 13:00:04,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 100 states and 123 transitions. Complement of second has 7 states. [2018-11-28 13:00:04,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:00:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-28 13:00:04,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 13:00:04,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:04,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-28 13:00:04,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:04,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-28 13:00:04,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:04,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 123 transitions. [2018-11-28 13:00:04,260 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-28 13:00:04,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 79 states and 99 transitions. [2018-11-28 13:00:04,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-28 13:00:04,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 13:00:04,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 99 transitions. [2018-11-28 13:00:04,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:04,263 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 99 transitions. [2018-11-28 13:00:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 99 transitions. [2018-11-28 13:00:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2018-11-28 13:00:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 13:00:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2018-11-28 13:00:04,266 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-28 13:00:04,266 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-28 13:00:04,266 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:00:04,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2018-11-28 13:00:04,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:00:04,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:04,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:04,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:04,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:00:04,268 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 633#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 631#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 624#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 625#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 632#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 640#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 636#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 626#L510-5 strspn_#res := strspn_~l~0; 627#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 644#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 635#L523-4 [2018-11-28 13:00:04,268 INFO L796 eck$LassoCheckResult]: Loop: 635#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 641#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 655#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 628#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 629#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 634#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 635#L523-4 [2018-11-28 13:00:04,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2118613646, now seen corresponding path program 1 times [2018-11-28 13:00:04,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:04,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:00:04,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:00:04,437 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:00:04,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 1 times [2018-11-28 13:00:04,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:04,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:04,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:04,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:04,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:00:04,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:00:04,497 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. cyclomatic complexity: 21 Second operand 9 states. [2018-11-28 13:00:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:00:04,715 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-28 13:00:04,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:00:04,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2018-11-28 13:00:04,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:00:04,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 70 transitions. [2018-11-28 13:00:04,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 13:00:04,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-28 13:00:04,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2018-11-28 13:00:04,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:04,719 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2018-11-28 13:00:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2018-11-28 13:00:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-11-28 13:00:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 13:00:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-11-28 13:00:04,725 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-28 13:00:04,725 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-28 13:00:04,725 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:00:04,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2018-11-28 13:00:04,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:00:04,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:04,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:04,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:04,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:04,727 INFO L794 eck$LassoCheckResult]: Stem: 789#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 763#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 762#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 755#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 756#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 764#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 771#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 776#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 800#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 787#L511-1 assume !strspn_#t~short7; 788#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 782#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 783#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 773#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 774#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 767#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 768#L511-6 [2018-11-28 13:00:04,728 INFO L796 eck$LassoCheckResult]: Loop: 768#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 778#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 786#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 791#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 768#L511-6 [2018-11-28 13:00:04,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash 60739587, now seen corresponding path program 1 times [2018-11-28 13:00:04,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:04,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:04,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:04,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:00:04,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:00:04,776 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:00:04,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:04,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 2 times [2018-11-28 13:00:04,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:04,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:04,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:04,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:04,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:00:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:00:04,910 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-28 13:00:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:00:04,960 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-11-28 13:00:04,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:00:04,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 91 transitions. [2018-11-28 13:00:04,964 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-28 13:00:04,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 87 transitions. [2018-11-28 13:00:04,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-28 13:00:04,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-28 13:00:04,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2018-11-28 13:00:04,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:04,966 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-11-28 13:00:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2018-11-28 13:00:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-11-28 13:00:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 13:00:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-11-28 13:00:04,971 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-11-28 13:00:04,971 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-11-28 13:00:04,971 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:00:04,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2018-11-28 13:00:04,971 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:00:04,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:04,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:04,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:04,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:00:04,974 INFO L794 eck$LassoCheckResult]: Stem: 924#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 896#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 895#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 888#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 889#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 897#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 904#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 900#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 901#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 929#L511-1 assume !strspn_#t~short7; 925#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 915#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 916#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 890#L510-5 strspn_#res := strspn_~l~0; 891#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 908#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 899#L523-4 [2018-11-28 13:00:04,974 INFO L796 eck$LassoCheckResult]: Loop: 899#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 905#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 920#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 892#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 893#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 898#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 899#L523-4 [2018-11-28 13:00:04,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash 60685095, now seen corresponding path program 1 times [2018-11-28 13:00:04,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:04,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:04,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:05,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 2 times [2018-11-28 13:00:05,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:05,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:05,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:05,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:05,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1593745617, now seen corresponding path program 1 times [2018-11-28 13:00:05,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:05,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:05,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:05,788 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 196 [2018-11-28 13:00:06,011 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-11-28 13:00:06,013 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:00:06,014 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:00:06,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:00:06,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:00:06,014 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:00:06,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:00:06,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:00:06,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:00:06,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration7_Lasso [2018-11-28 13:00:06,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:00:06,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:00:06,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,519 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 134 [2018-11-28 13:00:06,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:06,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:07,291 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:00:07,291 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:00:07,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:07,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:07,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:07,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:07,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:07,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:07,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,364 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:07,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,365 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:07,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,369 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:07,369 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:00:07,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,371 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 13:00:07,371 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 13:00:07,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,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-11-28 13:00:07,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:07,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:07,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:07,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:07,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:07,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:07,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-11-28 13:00:07,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:07,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:07,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:07,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:07,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:07,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:07,419 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:00:07,446 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:00:07,446 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:00:07,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:00:07,447 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:00:07,447 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:00:07,447 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1, ULTIMATE.start_strcspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1 - 1*ULTIMATE.start_strcspn_~s.offset Supporting invariants [] [2018-11-28 13:00:07,584 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2018-11-28 13:00:07,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:00:07,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:07,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:07,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:07,629 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:00:07,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 64 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-11-28 13:00:07,644 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 64 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 58 states and 74 transitions. Complement of second has 4 states. [2018-11-28 13:00:07,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:00:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-28 13:00:07,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-28 13:00:07,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:07,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-28 13:00:07,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:07,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 16 letters. Loop has 12 letters. [2018-11-28 13:00:07,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:07,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2018-11-28 13:00:07,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 13:00:07,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 56 states and 72 transitions. [2018-11-28 13:00:07,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 13:00:07,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 13:00:07,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2018-11-28 13:00:07,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:07,649 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-28 13:00:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2018-11-28 13:00:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-28 13:00:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 13:00:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2018-11-28 13:00:07,652 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-28 13:00:07,652 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-28 13:00:07,652 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:00:07,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2018-11-28 13:00:07,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 13:00:07,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:07,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:07,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:07,654 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:07,654 INFO L794 eck$LassoCheckResult]: Stem: 1240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1208#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1207#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1198#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1199#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1209#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1216#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1214#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1215#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1227#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 1243#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 1231#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1232#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 1220#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 1221#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1224#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1225#L511-6 [2018-11-28 13:00:07,654 INFO L796 eck$LassoCheckResult]: Loop: 1225#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1226#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 1244#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 1242#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 1225#L511-6 [2018-11-28 13:00:07,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:07,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1714267775, now seen corresponding path program 2 times [2018-11-28 13:00:07,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:07,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:07,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:07,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 3 times [2018-11-28 13:00:07,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:07,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:07,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:07,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:07,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:07,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1311163814, now seen corresponding path program 1 times [2018-11-28 13:00:07,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:07,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:07,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:08,488 WARN L180 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 186 [2018-11-28 13:00:08,690 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-11-28 13:00:08,692 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:00:08,692 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:00:08,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:00:08,693 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:00:08,693 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:00:08,693 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:00:08,693 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:00:08,693 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:00:08,693 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration8_Lasso [2018-11-28 13:00:08,693 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:00:08,693 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:00:08,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:08,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,138 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-11-28 13:00:09,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:09,752 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:00:09,752 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:00:09,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,783 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-28 13:00:09,783 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 13:00:09,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,791 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-11-28 13:00:09,791 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 13:00:09,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,834 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:09,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,835 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:09,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:09,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:09,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:09,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,859 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:09,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,860 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:09,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,867 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:09,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,868 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:09,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:09,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:09,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:09,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:09,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:09,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:09,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:09,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:09,905 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:00:09,923 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:00:09,923 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:00:09,924 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:00:09,924 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:00:09,925 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:00:09,925 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_4 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-11-28 13:00:10,070 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-28 13:00:10,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:00:10,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:10,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:10,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:10,166 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 13:00:10,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-28 13:00:10,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 116 states and 147 transitions. Complement of second has 7 states. [2018-11-28 13:00:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:00:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-28 13:00:10,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 13:00:10,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:10,229 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:00:10,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:10,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:10,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:10,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 13:00:10,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-28 13:00:10,350 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 116 states and 147 transitions. Complement of second has 7 states. [2018-11-28 13:00:10,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:00:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-28 13:00:10,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 13:00:10,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:10,351 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:00:10,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:10,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:10,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:10,415 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 13:00:10,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-28 13:00:10,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 99 states and 130 transitions. Complement of second has 6 states. [2018-11-28 13:00:10,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:00:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-28 13:00:10,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 13:00:10,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:10,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-28 13:00:10,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:10,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-28 13:00:10,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:10,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 130 transitions. [2018-11-28 13:00:10,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:10,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 61 states and 79 transitions. [2018-11-28 13:00:10,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 13:00:10,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 13:00:10,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 79 transitions. [2018-11-28 13:00:10,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:10,468 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 79 transitions. [2018-11-28 13:00:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 79 transitions. [2018-11-28 13:00:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-11-28 13:00:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 13:00:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-28 13:00:10,473 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-28 13:00:10,473 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-28 13:00:10,473 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 13:00:10,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-11-28 13:00:10,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:10,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:10,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:10,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:10,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:10,475 INFO L794 eck$LassoCheckResult]: Stem: 1987#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1957#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1956#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1947#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1948#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1958#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1965#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1961#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1962#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1974#L511-1 assume !strspn_#t~short7; 1985#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 1977#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1978#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 1949#L510-5 strspn_#res := strspn_~l~0; 1950#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 1971#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 1966#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1968#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 1983#L524-4 [2018-11-28 13:00:10,475 INFO L796 eck$LassoCheckResult]: Loop: 1983#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1951#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1952#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 1981#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 1983#L524-4 [2018-11-28 13:00:10,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:10,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1811163636, now seen corresponding path program 1 times [2018-11-28 13:00:10,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:10,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:10,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 1 times [2018-11-28 13:00:10,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:10,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:10,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:10,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1593747347, now seen corresponding path program 1 times [2018-11-28 13:00:10,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:10,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:10,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:10,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:10,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:10,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:00:10,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:00:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:00:10,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:00:10,672 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-28 13:00:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:00:10,863 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-11-28 13:00:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:00:10,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 119 transitions. [2018-11-28 13:00:10,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 13:00:10,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 78 states and 97 transitions. [2018-11-28 13:00:10,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 13:00:10,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-28 13:00:10,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 97 transitions. [2018-11-28 13:00:10,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:10,868 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-11-28 13:00:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 97 transitions. [2018-11-28 13:00:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2018-11-28 13:00:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 13:00:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-11-28 13:00:10,871 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-28 13:00:10,871 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-28 13:00:10,871 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 13:00:10,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-11-28 13:00:10,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:10,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:10,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:10,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:10,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:10,873 INFO L794 eck$LassoCheckResult]: Stem: 2157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2127#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2126#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2117#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2118#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2128#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2135#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2133#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2134#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2145#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2162#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 2148#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2149#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 2139#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 2140#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2142#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 2119#L510-5 strspn_#res := strspn_~l~0; 2120#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2141#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 2136#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2137#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2152#L524-4 [2018-11-28 13:00:10,873 INFO L796 eck$LassoCheckResult]: Loop: 2152#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2121#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2122#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2150#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2152#L524-4 [2018-11-28 13:00:10,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1960799173, now seen corresponding path program 1 times [2018-11-28 13:00:10,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:10,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:11,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:00:11,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:00:11,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:11,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:11,171 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 5 treesize of output 1 [2018-11-28 13:00:11,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:00:11,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-11-28 13:00:11,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 [2018-11-28 13:00:11,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:00:11,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:00:11,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:00:11,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:14 [2018-11-28 13:00:11,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:00:11,527 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:00:11,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 13:00:11,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:00:11,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:00:11,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:00:11,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2018-11-28 13:00:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:11,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:00:11,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-28 13:00:11,599 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:00:11,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 2 times [2018-11-28 13:00:11,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:11,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:11,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:11,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 13:00:11,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:00:11,663 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. cyclomatic complexity: 15 Second operand 22 states. [2018-11-28 13:00:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:00:12,116 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-11-28 13:00:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:00:12,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2018-11-28 13:00:12,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:12,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 111 transitions. [2018-11-28 13:00:12,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-28 13:00:12,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-28 13:00:12,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 111 transitions. [2018-11-28 13:00:12,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:12,119 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-11-28 13:00:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 111 transitions. [2018-11-28 13:00:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2018-11-28 13:00:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 13:00:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-11-28 13:00:12,122 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-28 13:00:12,122 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-28 13:00:12,122 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 13:00:12,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2018-11-28 13:00:12,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:12,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:12,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:12,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:12,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:12,123 INFO L794 eck$LassoCheckResult]: Stem: 2398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2366#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2365#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2356#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2357#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2367#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2374#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2370#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2371#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2383#L511-1 assume !strspn_#t~short7; 2397#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 2399#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2384#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2385#L511-1 assume !strspn_#t~short7; 2396#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 2386#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2387#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2358#L510-5 strspn_#res := strspn_~l~0; 2359#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2380#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 2375#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2376#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2394#L524-4 [2018-11-28 13:00:12,124 INFO L796 eck$LassoCheckResult]: Loop: 2394#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2360#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2361#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2390#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2394#L524-4 [2018-11-28 13:00:12,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1052721677, now seen corresponding path program 1 times [2018-11-28 13:00:12,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:12,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:12,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:00:12,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:00:12,151 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:00:12,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:12,151 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 3 times [2018-11-28 13:00:12,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:12,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:12,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:12,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:00:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:00:12,195 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-11-28 13:00:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:00:12,203 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-28 13:00:12,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:00:12,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 72 transitions. [2018-11-28 13:00:12,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:12,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 58 states and 69 transitions. [2018-11-28 13:00:12,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 13:00:12,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 13:00:12,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 69 transitions. [2018-11-28 13:00:12,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:12,206 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-28 13:00:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 69 transitions. [2018-11-28 13:00:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-28 13:00:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 13:00:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-28 13:00:12,209 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-28 13:00:12,209 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-28 13:00:12,209 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 13:00:12,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 68 transitions. [2018-11-28 13:00:12,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:12,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:12,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:12,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:12,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:12,210 INFO L794 eck$LassoCheckResult]: Stem: 2522#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2490#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2489#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2480#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2481#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2491#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2498#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2494#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2495#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2507#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2528#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 2527#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2526#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2519#L511-1 assume !strspn_#t~short7; 2520#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 2510#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2511#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2482#L510-5 strspn_#res := strspn_~l~0; 2483#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2504#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 2499#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2500#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2517#L524-4 [2018-11-28 13:00:12,210 INFO L796 eck$LassoCheckResult]: Loop: 2517#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2484#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2485#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2514#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2517#L524-4 [2018-11-28 13:00:12,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash -465915663, now seen corresponding path program 1 times [2018-11-28 13:00:12,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:12,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:12,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:12,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:12,235 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 4 times [2018-11-28 13:00:12,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:12,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:12,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:12,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:12,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash -187987976, now seen corresponding path program 1 times [2018-11-28 13:00:12,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:12,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:12,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:12,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:13,593 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 278 DAG size of output: 226 [2018-11-28 13:00:13,869 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2018-11-28 13:00:13,873 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:00:13,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:00:13,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:00:13,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:00:13,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:00:13,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:00:13,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:00:13,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:00:13,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration12_Lasso [2018-11-28 13:00:13,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:00:13,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:00:13,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:13,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,669 WARN L180 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 154 [2018-11-28 13:00:14,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:14,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:15,076 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-28 13:00:15,659 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-28 13:00:15,716 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:00:15,716 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:00:15,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,749 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:15,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,751 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:15,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:15,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:15,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:15,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:15,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:15,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:15,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:15,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:15,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:15,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:15,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:15,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:15,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:15,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:15,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:15,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:15,800 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:00:15,820 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:00:15,820 INFO L444 ModelExtractionUtils]: 75 out of 82 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 13:00:15,820 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:00:15,821 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:00:15,821 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:00:15,821 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-11-28 13:00:16,064 INFO L297 tatePredicateManager]: 56 out of 56 supporting invariants were superfluous and have been removed [2018-11-28 13:00:16,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:00:16,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:16,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:16,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:16,121 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:00:16,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-11-28 13:00:16,132 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 84 states and 98 transitions. Complement of second has 5 states. [2018-11-28 13:00:16,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:00:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-28 13:00:16,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-28 13:00:16,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:16,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-28 13:00:16,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:16,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-28 13:00:16,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:16,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2018-11-28 13:00:16,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:16,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 68 states and 80 transitions. [2018-11-28 13:00:16,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 13:00:16,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 13:00:16,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 80 transitions. [2018-11-28 13:00:16,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:16,135 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-11-28 13:00:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 80 transitions. [2018-11-28 13:00:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-11-28 13:00:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 13:00:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-28 13:00:16,137 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-28 13:00:16,137 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-28 13:00:16,137 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 13:00:16,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 74 transitions. [2018-11-28 13:00:16,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:16,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:16,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:16,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:16,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:16,139 INFO L794 eck$LassoCheckResult]: Stem: 2990#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2953#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2952#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2944#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2945#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2954#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2961#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2957#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2958#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2972#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2996#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 2995#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2994#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2986#L511-1 assume !strspn_#t~short7; 2987#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 2976#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2977#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2946#L510-5 strspn_#res := strspn_~l~0; 2947#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2968#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 2962#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2963#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3003#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2997#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 2992#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 2955#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 2956#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2964#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2984#L524-4 [2018-11-28 13:00:16,139 INFO L796 eck$LassoCheckResult]: Loop: 2984#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2948#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2949#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2980#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2984#L524-4 [2018-11-28 13:00:16,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:16,139 INFO L82 PathProgramCache]: Analyzing trace with hash -269478821, now seen corresponding path program 1 times [2018-11-28 13:00:16,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:16,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:16,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:00:16,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:00:16,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:16,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:16,444 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 16 treesize of output 12 [2018-11-28 13:00:16,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 13:00:16,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:00:16,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:00:16,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:00:16,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-28 13:00:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:00:16,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:00:16,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-28 13:00:16,469 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:00:16,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 5 times [2018-11-28 13:00:16,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:16,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:00:16,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:00:16,504 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. cyclomatic complexity: 17 Second operand 17 states. [2018-11-28 13:00:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:00:16,887 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-11-28 13:00:16,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:00:16,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 161 transitions. [2018-11-28 13:00:16,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 13:00:16,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 140 states and 159 transitions. [2018-11-28 13:00:16,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-28 13:00:16,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-28 13:00:16,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2018-11-28 13:00:16,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:16,891 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-11-28 13:00:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2018-11-28 13:00:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 66. [2018-11-28 13:00:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 13:00:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-11-28 13:00:16,894 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-11-28 13:00:16,894 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-11-28 13:00:16,894 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 13:00:16,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 77 transitions. [2018-11-28 13:00:16,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:16,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:16,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:16,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:16,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:16,896 INFO L794 eck$LassoCheckResult]: Stem: 3316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3283#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 3282#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 3274#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 3275#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 3284#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 3291#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 3287#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 3288#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3300#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 3322#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 3321#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 3320#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3313#L511-1 assume !strspn_#t~short7; 3314#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 3304#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 3305#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 3276#L510-5 strspn_#res := strspn_~l~0; 3277#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 3298#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 3292#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3293#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3311#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3280#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3281#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 3309#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3312#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3323#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 3317#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 3285#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 3286#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3294#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3310#L524-4 [2018-11-28 13:00:16,896 INFO L796 eck$LassoCheckResult]: Loop: 3310#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3278#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3279#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 3308#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3310#L524-4 [2018-11-28 13:00:16,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:16,896 INFO L82 PathProgramCache]: Analyzing trace with hash 579815970, now seen corresponding path program 1 times [2018-11-28 13:00:16,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:16,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:16,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:16,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:16,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 6 times [2018-11-28 13:00:16,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:16,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1474175145, now seen corresponding path program 2 times [2018-11-28 13:00:16,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:16,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:16,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:18,345 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 329 DAG size of output: 255 [2018-11-28 13:00:18,599 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-28 13:00:18,601 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:00:18,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:00:18,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:00:18,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:00:18,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:00:18,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:00:18,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:00:18,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:00:18,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration14_Lasso [2018-11-28 13:00:18,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:00:18,601 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:00:18,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:18,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,342 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 157 [2018-11-28 13:00:19,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:19,776 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-28 13:00:20,202 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 13:00:20,428 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-28 13:00:20,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:00:20,504 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:00:20,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:20,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:20,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:20,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:20,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:20,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:20,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:20,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:20,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:20,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:20,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:20,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:20,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:20,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:20,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:20,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,514 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:20,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,515 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:20,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:20,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,518 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:20,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,520 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:20,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:20,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,527 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-28 13:00:20,527 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 13:00:20,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,541 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-11-28 13:00:20,541 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 13:00:20,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,610 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:20,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,612 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:20,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:20,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:20,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:20,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:20,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:20,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:20,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:20,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:20,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:20,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:20,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:20,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:20,664 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:00:20,703 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 13:00:20,704 INFO L444 ModelExtractionUtils]: 80 out of 88 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 13:00:20,704 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:00:20,705 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:00:20,705 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:00:20,705 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3) = -2*ULTIMATE.start_strcspn_~i~0 + 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 Supporting invariants [] [2018-11-28 13:00:20,909 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2018-11-28 13:00:20,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:00:20,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:20,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:21,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:21,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 3 loop predicates [2018-11-28 13:00:21,078 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-28 13:00:21,214 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 81 states and 94 transitions. Complement of second has 8 states. [2018-11-28 13:00:21,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 13:00:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-28 13:00:21,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-28 13:00:21,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:21,217 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:00:21,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:21,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:21,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:21,394 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 3 loop predicates [2018-11-28 13:00:21,394 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-28 13:00:21,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 81 states and 94 transitions. Complement of second has 8 states. [2018-11-28 13:00:21,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 13:00:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-28 13:00:21,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-28 13:00:21,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:21,565 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:00:21,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:21,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:21,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:21,739 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 3 loop predicates [2018-11-28 13:00:21,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-28 13:00:21,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 133 states and 153 transitions. Complement of second has 15 states. [2018-11-28 13:00:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-28 13:00:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 13:00:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-28 13:00:21,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-28 13:00:21,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:21,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 36 letters. Loop has 4 letters. [2018-11-28 13:00:21,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:21,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 8 letters. [2018-11-28 13:00:21,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:21,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2018-11-28 13:00:21,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 13:00:21,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 119 states and 136 transitions. [2018-11-28 13:00:21,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-28 13:00:21,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-28 13:00:21,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 136 transitions. [2018-11-28 13:00:21,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:21,980 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-11-28 13:00:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 136 transitions. [2018-11-28 13:00:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2018-11-28 13:00:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 13:00:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-11-28 13:00:21,983 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-11-28 13:00:21,983 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-11-28 13:00:21,984 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 13:00:21,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2018-11-28 13:00:21,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:21,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:21,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:21,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:21,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:21,986 INFO L794 eck$LassoCheckResult]: Stem: 4302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4270#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4268#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 4260#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4261#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4269#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4277#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4284#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4325#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4324#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4322#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 4320#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4319#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4316#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4285#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4275#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4276#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4288#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4312#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 4291#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4292#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4280#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4281#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4313#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 4262#L510-5 strspn_#res := strspn_~l~0; 4263#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4282#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 4278#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4279#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4297#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4303#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4348#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4347#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4346#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4344#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4304#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4305#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 4310#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4295#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4296#L524-4 [2018-11-28 13:00:21,986 INFO L796 eck$LassoCheckResult]: Loop: 4296#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4264#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4265#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4293#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4296#L524-4 [2018-11-28 13:00:21,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1481576100, now seen corresponding path program 1 times [2018-11-28 13:00:21,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:21,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:21,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:21,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:21,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:00:22,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:00:22,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9d0eeed-921f-48ef-9e5a-1948674e9c99/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:00:22,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:22,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:22,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-11-28 13:00:22,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 [2018-11-28 13:00:22,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:00:22,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:00:22,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:00:22,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-11-28 13:00:22,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:00:22,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:00:22,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:00:22,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:00:22,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:00:22,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 13:00:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:00:22,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:00:22,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-11-28 13:00:22,647 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:00:22,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 7 times [2018-11-28 13:00:22,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:22,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:22,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 13:00:22,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-11-28 13:00:22,681 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. cyclomatic complexity: 22 Second operand 27 states. [2018-11-28 13:00:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:00:23,181 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-11-28 13:00:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:00:23,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 159 transitions. [2018-11-28 13:00:23,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:23,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 133 states and 154 transitions. [2018-11-28 13:00:23,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-28 13:00:23,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-28 13:00:23,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 154 transitions. [2018-11-28 13:00:23,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:00:23,186 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-11-28 13:00:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 154 transitions. [2018-11-28 13:00:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-11-28 13:00:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 13:00:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-11-28 13:00:23,193 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-11-28 13:00:23,193 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-11-28 13:00:23,193 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 13:00:23,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2018-11-28 13:00:23,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 13:00:23,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:00:23,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:00:23,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:00:23,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:00:23,195 INFO L794 eck$LassoCheckResult]: Stem: 4702#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4665#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4664#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 4656#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4657#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4666#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4673#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4681#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4752#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4751#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4750#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 4749#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4747#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4746#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4682#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4669#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4670#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4683#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4734#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 4733#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 4732#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4699#L511-1 assume !strspn_#t~short7; 4700#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem5;havoc strspn_#t~short7;havoc strspn_#t~mem6; 4686#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4687#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 4658#L510-5 strspn_#res := strspn_~l~0; 4659#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4693#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, 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~1 := 0;havoc strcspn_~i~0; 4674#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4675#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4696#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4662#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4663#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4697#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4698#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4709#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4703#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4704#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 4706#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4694#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4695#L524-4 [2018-11-28 13:00:23,195 INFO L796 eck$LassoCheckResult]: Loop: 4695#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4660#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4661#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4690#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4695#L524-4 [2018-11-28 13:00:23,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash -760734412, now seen corresponding path program 1 times [2018-11-28 13:00:23,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:23,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:23,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:23,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:23,231 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 8 times [2018-11-28 13:00:23,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:23,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:23,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:23,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:00:23,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:23,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -632087877, now seen corresponding path program 2 times [2018-11-28 13:00:23,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:00:23,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:00:23,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:23,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:00:23,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:00:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:00:25,120 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 384 DAG size of output: 282 [2018-11-28 13:00:25,407 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-11-28 13:00:25,410 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:00:25,410 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:00:25,410 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:00:25,410 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:00:25,410 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:00:25,410 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:00:25,410 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:00:25,410 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:00:25,410 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration16_Lasso [2018-11-28 13:00:25,411 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:00:25,411 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:00:25,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:25,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,246 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 159 [2018-11-28 13:00:26,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:00:26,680 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-28 13:00:27,197 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-28 13:00:27,456 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-28 13:00:27,505 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:00:27,505 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:00:27,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:00:27,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:00:27,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:00:27,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,535 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:27,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,536 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:27,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,544 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-28 13:00:27,544 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 13:00:27,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,561 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-11-28 13:00:27,561 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 13:00:27,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,667 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:27,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,668 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:27,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,677 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:00:27,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,678 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:00:27,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:00:27,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:00:27,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:00:27,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:00:27,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:00:27,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:00:27,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:00:27,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:00:27,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:00:27,735 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:00:27,735 INFO L444 ModelExtractionUtils]: 74 out of 79 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:00:27,736 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:00:27,736 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:00:27,736 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:00:27,736 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-11-28 13:00:28,325 INFO L297 tatePredicateManager]: 68 out of 68 supporting invariants were superfluous and have been removed [2018-11-28 13:00:28,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:00:28,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:28,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:28,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:28,373 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:00:28,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-28 13:00:28,386 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 130 states and 150 transitions. Complement of second has 5 states. [2018-11-28 13:00:28,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:00:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-28 13:00:28,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-28 13:00:28,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:28,387 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:00:28,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:28,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:28,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:28,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:00:28,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-28 13:00:28,444 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 130 states and 150 transitions. Complement of second has 5 states. [2018-11-28 13:00:28,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:00:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-28 13:00:28,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-28 13:00:28,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:28,445 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:00:28,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:00:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:28,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:00:28,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:00:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:00:28,493 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:00:28,493 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-28 13:00:28,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 127 states and 148 transitions. Complement of second has 4 states. [2018-11-28 13:00:28,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:00:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:00:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-28 13:00:28,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-28 13:00:28,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:28,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 44 letters. Loop has 4 letters. [2018-11-28 13:00:28,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:28,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 8 letters. [2018-11-28 13:00:28,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:00:28,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 148 transitions. [2018-11-28 13:00:28,507 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:00:28,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 0 states and 0 transitions. [2018-11-28 13:00:28,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:00:28,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:00:28,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:00:28,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:00:28,507 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:00:28,507 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:00:28,507 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:00:28,507 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 13:00:28,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:00:28,508 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:00:28,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:00:28,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:00:28 BoogieIcfgContainer [2018-11-28 13:00:28,514 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:00:28,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:00:28,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:00:28,514 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:00:28,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:59:58" (3/4) ... [2018-11-28 13:00:28,517 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:00:28,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:00:28,518 INFO L168 Benchmark]: Toolchain (without parser) took 30558.09 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 651.2 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -210.1 MB). Peak memory consumption was 441.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:00:28,519 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:00:28,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:00:28,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:00:28,520 INFO L168 Benchmark]: Boogie Preprocessor took 31.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:00:28,520 INFO L168 Benchmark]: RCFGBuilder took 445.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:00:28,521 INFO L168 Benchmark]: BuchiAutomizer took 29596.30 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 524.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.0 MB). Peak memory consumption was 434.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:00:28,521 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:00:28,523 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 436.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 445.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29596.30 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 524.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.0 MB). Peak memory consumption was 434.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.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 - 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 16 terminating modules (9 trivial, 4 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (delim_len)] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (delim_len)] + -1 * a and consists of 5 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 11 locations. One nondeterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.5s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 25.3s. Construction of modules took 0.9s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 277 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 101 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 606 SDtfs, 1717 SDslu, 1144 SDs, 0 SdLazy, 1397 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI1 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax100 hnf99 lsp96 ukn75 mio100 lsp39 div107 bol100 ite100 ukn100 eq191 hnf85 smp96 dnf150 smp87 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 82ms VariablesStem: 5 VariablesLoop: 4 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...