./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/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 32bit --witnessprinter.graph.data.programhash 49da897df5dcdfc1bc615bb8c40422792fce477f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:11:57,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:11:57,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:11:57,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:11:57,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:11:57,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:11:57,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:11:57,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:11:57,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:11:57,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:11:57,350 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:11:57,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:11:57,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:11:57,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:11:57,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:11:57,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:11:57,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:11:57,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:11:57,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:11:57,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:11:57,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:11:57,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:11:57,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:11:57,363 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:11:57,363 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:11:57,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:11:57,365 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:11:57,365 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:11:57,366 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:11:57,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:11:57,367 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:11:57,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:11:57,367 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:11:57,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:11:57,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:11:57,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:11:57,369 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:11:57,376 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:11:57,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:11:57,377 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:11:57,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:11:57,378 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:11:57,378 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:11:57,378 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:11:57,378 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:11:57,378 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:11:57,378 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:11:57,378 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:11:57,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:11:57,379 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:11:57,379 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:11:57,379 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:11:57,379 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:11:57,379 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:11:57,379 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:11:57,379 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:11:57,380 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:11:57,381 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:11:57,381 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:11:57,381 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:11:57,382 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:11:57,382 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:11:57,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:11:57,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:11:57,382 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:11:57,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:11:57,382 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:11:57,383 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:11:57,383 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:11:57,383 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49da897df5dcdfc1bc615bb8c40422792fce477f [2018-11-18 11:11:57,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:11:57,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:11:57,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:11:57,422 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:11:57,423 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:11:57,423 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-18 11:11:57,468 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/data/b3e137ce0/64c796370764424b890503b69a53f3c5/FLAGa65a41b29 [2018-11-18 11:11:57,893 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:11:57,893 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-18 11:11:57,899 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/data/b3e137ce0/64c796370764424b890503b69a53f3c5/FLAGa65a41b29 [2018-11-18 11:11:57,935 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/bin-2019/uautomizer/data/b3e137ce0/64c796370764424b890503b69a53f3c5 [2018-11-18 11:11:57,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:11:57,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:11:57,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:11:57,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:11:57,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:11:57,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:11:57" (1/1) ... [2018-11-18 11:11:57,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700fd1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:57, skipping insertion in model container [2018-11-18 11:11:57,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:11:57" (1/1) ... [2018-11-18 11:11:57,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:11:57,969 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:11:58,097 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:11:58,104 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:11:58,125 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:11:58,139 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:11:58,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58 WrapperNode [2018-11-18 11:11:58,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:11:58,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:11:58,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:11:58,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:11:58,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:11:58,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:11:58,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:11:58,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:11:58,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... [2018-11-18 11:11:58,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:11:58,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:11:58,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:11:58,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:11:58,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/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-18 11:11:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-18 11:11:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:11:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:11:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:11:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:11:58,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:11:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:11:58,602 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:11:58,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:58 BoogieIcfgContainer [2018-11-18 11:11:58,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:11:58,603 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:11:58,603 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:11:58,606 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:11:58,607 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:11:58,607 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:11:57" (1/3) ... [2018-11-18 11:11:58,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44053e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:11:58, skipping insertion in model container [2018-11-18 11:11:58,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:11:58,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:11:58" (2/3) ... [2018-11-18 11:11:58,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44053e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:11:58, skipping insertion in model container [2018-11-18 11:11:58,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:11:58,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:58" (3/3) ... [2018-11-18 11:11:58,610 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-18 11:11:58,652 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:11:58,653 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:11:58,653 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:11:58,653 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:11:58,653 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:11:58,653 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:11:58,653 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:11:58,654 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:11:58,654 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:11:58,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-18 11:11:58,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 11:11:58,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:11:58,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:11:58,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 11:11:58,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:11:58,694 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:11:58,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-18 11:11:58,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 11:11:58,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:11:58,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:11:58,696 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 11:11:58,696 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:11:58,703 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 9#L51true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 21#L52-4true [2018-11-18 11:11:58,703 INFO L796 eck$LassoCheckResult]: Loop: 21#L52-4true assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 30#L55true assume !parse_expression_list_#t~switch3; 12#L54true havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 26#L52-1true call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 24#L52-2true assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 21#L52-4true [2018-11-18 11:11:58,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-18 11:11:58,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:11:58,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:11:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:58,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:58,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:58,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:58,818 INFO L82 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2018-11-18 11:11:58,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:11:58,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:11:58,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:58,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:58,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:58,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2018-11-18 11:11:58,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:11:58,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:11:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:58,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:58,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:11:59,134 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:11:59,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:11:59,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:11:59,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:11:59,135 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:11:59,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:11:59,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:11:59,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:11:59,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 11:11:59,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:11:59,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:11:59,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,358 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-18 11:11:59,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-18 11:11:59,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-18 11:11:59,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-18 11:11:59,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-18 11:11:59,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:11:59,649 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:11:59,652 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:11:59,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:59,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:59,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:59,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:59,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:59,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:59,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:59,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:59,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:59,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:59,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:59,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:59,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:59,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:59,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:59,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:59,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,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-18 11:11:59,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:59,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:59,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:59,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:59,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:59,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:59,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:59,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:59,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:59,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:11:59,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:59,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:59,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:59,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:59,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:59,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:11:59,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,711 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:11:59,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,712 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:11:59,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:11:59,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:11:59,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:11:59,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:11:59,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:11:59,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:11:59,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:11:59,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:11:59,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:11:59,749 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:11:59,779 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 11:11:59,780 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 11:11:59,782 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:11:59,783 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:11:59,784 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:11:59,784 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~i~0) = -1*ULTIMATE.start_parse_expression_list_~str.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2018-11-18 11:11:59,820 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-18 11:11:59,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:11:59,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:59,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:11:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:59,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:11:59,919 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-18 11:11:59,933 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-18 11:11:59,934 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states. Second operand 3 states. [2018-11-18 11:12:00,028 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states.. Second operand 3 states. Result 102 states and 141 transitions. Complement of second has 5 states. [2018-11-18 11:12:00,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 11:12:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 11:12:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2018-11-18 11:12:00,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-18 11:12:00,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:00,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-18 11:12:00,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:00,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-18 11:12:00,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:00,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 141 transitions. [2018-11-18 11:12:00,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:00,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 43 states and 58 transitions. [2018-11-18 11:12:00,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 11:12:00,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 11:12:00,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 58 transitions. [2018-11-18 11:12:00,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:00,044 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-11-18 11:12:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 58 transitions. [2018-11-18 11:12:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-18 11:12:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 11:12:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2018-11-18 11:12:00,066 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2018-11-18 11:12:00,066 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2018-11-18 11:12:00,066 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:12:00,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. [2018-11-18 11:12:00,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:00,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:00,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:00,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:12:00,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:12:00,067 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 216#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 217#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 232#L55 assume parse_expression_list_#t~switch3; 239#L56-6 [2018-11-18 11:12:00,067 INFO L796 eck$LassoCheckResult]: Loop: 239#L56-6 assume true; 227#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 221#L56-2 assume parse_expression_list_#t~short6; 222#L56-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 239#L56-6 [2018-11-18 11:12:00,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2018-11-18 11:12:00,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:00,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1479723, now seen corresponding path program 1 times [2018-11-18 11:12:00,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:00,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:00,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1240104497, now seen corresponding path program 1 times [2018-11-18 11:12:00,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:00,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:00,284 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-18 11:12:00,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:00,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:12:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:12:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:12:00,346 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-18 11:12:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:00,434 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2018-11-18 11:12:00,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:12:00,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 103 transitions. [2018-11-18 11:12:00,437 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 11:12:00,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 103 transitions. [2018-11-18 11:12:00,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 11:12:00,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 11:12:00,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 103 transitions. [2018-11-18 11:12:00,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:00,438 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 103 transitions. [2018-11-18 11:12:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 103 transitions. [2018-11-18 11:12:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 51. [2018-11-18 11:12:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 11:12:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2018-11-18 11:12:00,442 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 68 transitions. [2018-11-18 11:12:00,442 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 68 transitions. [2018-11-18 11:12:00,442 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:12:00,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 68 transitions. [2018-11-18 11:12:00,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:00,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:00,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:00,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:00,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:12:00,445 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 352#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 348#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 349#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 365#L55 assume !parse_expression_list_#t~switch3; 353#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 354#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 376#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 366#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 367#L55 assume parse_expression_list_#t~switch3; 381#L56-6 [2018-11-18 11:12:00,445 INFO L796 eck$LassoCheckResult]: Loop: 381#L56-6 assume true; 359#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 360#L56-2 assume parse_expression_list_#t~short6; 390#L56-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 381#L56-6 [2018-11-18 11:12:00,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2018-11-18 11:12:00,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1479723, now seen corresponding path program 2 times [2018-11-18 11:12:00,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1156507579, now seen corresponding path program 1 times [2018-11-18 11:12:00,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:00,704 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-11-18 11:12:00,745 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:12:00,745 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:12:00,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:12:00,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:12:00,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:12:00,746 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:12:00,746 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:12:00,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:12:00,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-18 11:12:00,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:12:00,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:12:00,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,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-18 11:12:00,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,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-18 11:12:00,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-18 11:12:00,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-18 11:12:00,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:00,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-18 11:12:00,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-18 11:12:00,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-18 11:12:00,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-18 11:12:01,113 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:12:01,113 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:12:01,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:01,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:01,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:01,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,164 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:12:01,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,165 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:12:01,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,172 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:12:01,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,173 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:12:01,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:01,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:01,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:01,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:01,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:01,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:01,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:01,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:01,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:12:01,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:12:01,210 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:12:01,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:12:01,211 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:12:01,211 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:12:01,211 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2, ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 - 1*ULTIMATE.start_parse_expression_list_~str.offset Supporting invariants [] [2018-11-18 11:12:01,259 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 11:12:01,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:12:01,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:01,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:12:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:01,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:12:01,388 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-18 11:12:01,388 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-18 11:12:01,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 68 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-18 11:12:01,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 68 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 168 states and 228 transitions. Complement of second has 7 states. [2018-11-18 11:12:01,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:12:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:12:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-18 11:12:01,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 11:12:01,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:01,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-18 11:12:01,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:01,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-18 11:12:01,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:01,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 228 transitions. [2018-11-18 11:12:01,475 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2018-11-18 11:12:01,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 128 states and 172 transitions. [2018-11-18 11:12:01,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-18 11:12:01,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-18 11:12:01,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 172 transitions. [2018-11-18 11:12:01,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:01,478 INFO L705 BuchiCegarLoop]: Abstraction has 128 states and 172 transitions. [2018-11-18 11:12:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 172 transitions. [2018-11-18 11:12:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2018-11-18 11:12:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 11:12:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2018-11-18 11:12:01,483 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 113 transitions. [2018-11-18 11:12:01,483 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 113 transitions. [2018-11-18 11:12:01,483 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:12:01,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 113 transitions. [2018-11-18 11:12:01,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:01,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:01,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:01,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:01,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:12:01,487 INFO L794 eck$LassoCheckResult]: Stem: 702#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 669#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 670#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 686#L55 assume parse_expression_list_#t~switch3; 730#L56-6 assume true; 728#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 725#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 722#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 716#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 712#L57 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 705#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 665#L59-9 [2018-11-18 11:12:01,487 INFO L796 eck$LassoCheckResult]: Loop: 665#L59-9 assume true; 666#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 684#L59-2 assume !parse_expression_list_#t~short13; 671#L59-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 665#L59-9 [2018-11-18 11:12:01,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1353787750, now seen corresponding path program 1 times [2018-11-18 11:12:01,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:01,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:01,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:01,711 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2018-11-18 11:12:01,772 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-18 11:12:01,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:01,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:12:01,773 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:12:01,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2341961, now seen corresponding path program 1 times [2018-11-18 11:12:01,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:01,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:01,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:01,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:01,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:01,777 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-18 11:12:01,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:01,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:12:01,778 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:12:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:12:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:12:01,778 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-18 11:12:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:01,785 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2018-11-18 11:12:01,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:12:01,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 114 transitions. [2018-11-18 11:12:01,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:01,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 84 states and 113 transitions. [2018-11-18 11:12:01,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 11:12:01,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 11:12:01,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2018-11-18 11:12:01,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:01,787 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-18 11:12:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2018-11-18 11:12:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-18 11:12:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 11:12:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2018-11-18 11:12:01,790 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-18 11:12:01,790 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-18 11:12:01,790 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:12:01,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2018-11-18 11:12:01,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:01,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:01,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:01,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:01,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:12:01,792 INFO L794 eck$LassoCheckResult]: Stem: 880#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 848#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 849#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 864#L55 assume parse_expression_list_#t~switch3; 905#L56-6 assume true; 903#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 901#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 898#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 894#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 890#L57 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 885#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 844#L59-9 [2018-11-18 11:12:01,792 INFO L796 eck$LassoCheckResult]: Loop: 844#L59-9 assume true; 845#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 862#L59-2 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 888#L59-3 assume parse_expression_list_#t~short12; 881#L59-5 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 850#L59-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 844#L59-9 [2018-11-18 11:12:01,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1353787750, now seen corresponding path program 2 times [2018-11-18 11:12:01,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:01,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:01,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:02,047 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-18 11:12:02,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:02,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:12:02,048 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:12:02,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2044620562, now seen corresponding path program 1 times [2018-11-18 11:12:02,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:02,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:12:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:12:02,109 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. cyclomatic complexity: 35 Second operand 7 states. [2018-11-18 11:12:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:02,200 INFO L93 Difference]: Finished difference Result 117 states and 150 transitions. [2018-11-18 11:12:02,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:12:02,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 150 transitions. [2018-11-18 11:12:02,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 11:12:02,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 107 states and 140 transitions. [2018-11-18 11:12:02,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-18 11:12:02,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 11:12:02,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 140 transitions. [2018-11-18 11:12:02,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:02,203 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 140 transitions. [2018-11-18 11:12:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 140 transitions. [2018-11-18 11:12:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2018-11-18 11:12:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 11:12:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2018-11-18 11:12:02,207 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 105 transitions. [2018-11-18 11:12:02,207 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 105 transitions. [2018-11-18 11:12:02,207 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:12:02,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 105 transitions. [2018-11-18 11:12:02,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:02,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:02,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:02,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:02,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:12:02,209 INFO L794 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1065#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1061#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1062#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1077#L55 assume parse_expression_list_#t~switch3; 1086#L56-6 assume true; 1072#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1068#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 1069#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 1080#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1081#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 1094#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1057#L59-9 [2018-11-18 11:12:02,209 INFO L796 eck$LassoCheckResult]: Loop: 1057#L59-9 assume true; 1058#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1075#L59-2 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 1097#L59-3 assume parse_expression_list_#t~short12; 1090#L59-5 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 1063#L59-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 1057#L59-9 [2018-11-18 11:12:02,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1353787688, now seen corresponding path program 1 times [2018-11-18 11:12:02,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:02,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2044620562, now seen corresponding path program 2 times [2018-11-18 11:12:02,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash -439113083, now seen corresponding path program 1 times [2018-11-18 11:12:02,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:02,352 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-18 11:12:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:02,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:12:02,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:12:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:12:02,399 INFO L87 Difference]: Start difference. First operand 78 states and 105 transitions. cyclomatic complexity: 33 Second operand 6 states. [2018-11-18 11:12:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:02,468 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2018-11-18 11:12:02,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:12:02,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 163 transitions. [2018-11-18 11:12:02,469 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 11:12:02,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 117 states and 153 transitions. [2018-11-18 11:12:02,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 11:12:02,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 11:12:02,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 153 transitions. [2018-11-18 11:12:02,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:02,471 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 153 transitions. [2018-11-18 11:12:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 153 transitions. [2018-11-18 11:12:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2018-11-18 11:12:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 11:12:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 108 transitions. [2018-11-18 11:12:02,474 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 108 transitions. [2018-11-18 11:12:02,474 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 108 transitions. [2018-11-18 11:12:02,474 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:12:02,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 108 transitions. [2018-11-18 11:12:02,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:02,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:02,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:02,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:02,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:12:02,475 INFO L794 eck$LassoCheckResult]: Stem: 1318#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1283#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1284#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1301#L55 assume !parse_expression_list_#t~switch3; 1322#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1356#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1355#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1302#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1303#L55 assume parse_expression_list_#t~switch3; 1308#L56-6 assume true; 1294#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1290#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 1291#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 1304#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1305#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 1323#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1279#L59-9 [2018-11-18 11:12:02,476 INFO L796 eck$LassoCheckResult]: Loop: 1279#L59-9 assume true; 1280#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1298#L59-2 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 1326#L59-3 assume parse_expression_list_#t~short12; 1319#L59-5 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 1285#L59-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 1279#L59-9 [2018-11-18 11:12:02,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash -708540146, now seen corresponding path program 1 times [2018-11-18 11:12:02,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:02,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2044620562, now seen corresponding path program 3 times [2018-11-18 11:12:02,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:02,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash -565420997, now seen corresponding path program 1 times [2018-11-18 11:12:02,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:02,559 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-18 11:12:02,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:12:02,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/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-18 11:12:02,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:02,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:12:02,587 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-18 11:12:02,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:12:02,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-18 11:12:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:12:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:12:02,658 INFO L87 Difference]: Start difference. First operand 82 states and 108 transitions. cyclomatic complexity: 32 Second operand 7 states. [2018-11-18 11:12:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:02,734 INFO L93 Difference]: Finished difference Result 178 states and 234 transitions. [2018-11-18 11:12:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:12:02,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 234 transitions. [2018-11-18 11:12:02,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 11:12:02,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 160 states and 209 transitions. [2018-11-18 11:12:02,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 11:12:02,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 11:12:02,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 209 transitions. [2018-11-18 11:12:02,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:02,738 INFO L705 BuchiCegarLoop]: Abstraction has 160 states and 209 transitions. [2018-11-18 11:12:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 209 transitions. [2018-11-18 11:12:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 125. [2018-11-18 11:12:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 11:12:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 164 transitions. [2018-11-18 11:12:02,746 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 164 transitions. [2018-11-18 11:12:02,746 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 164 transitions. [2018-11-18 11:12:02,746 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:12:02,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 164 transitions. [2018-11-18 11:12:02,747 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 11:12:02,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:02,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:02,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:02,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:12:02,748 INFO L794 eck$LassoCheckResult]: Stem: 1664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1635#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1631#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1632#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1649#L55 assume !parse_expression_list_#t~switch3; 1716#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1715#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1714#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1713#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1711#L55 assume !parse_expression_list_#t~switch3; 1693#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1706#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1701#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1697#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1692#L55 assume parse_expression_list_#t~switch3; 1694#L56-6 assume true; 1719#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1722#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 1721#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 1718#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1681#L57 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 1668#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1627#L59-9 [2018-11-18 11:12:02,750 INFO L796 eck$LassoCheckResult]: Loop: 1627#L59-9 assume true; 1628#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1646#L59-2 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 1673#L59-3 assume parse_expression_list_#t~short12; 1665#L59-5 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 1633#L59-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 1627#L59-9 [2018-11-18 11:12:02,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1959540646, now seen corresponding path program 1 times [2018-11-18 11:12:02,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:02,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2044620562, now seen corresponding path program 4 times [2018-11-18 11:12:02,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:02,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash -513150329, now seen corresponding path program 1 times [2018-11-18 11:12:02,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:02,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:02,904 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-18 11:12:03,173 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 113 [2018-11-18 11:12:03,228 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:12:03,228 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:12:03,228 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:12:03,228 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:12:03,228 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:12:03,228 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:12:03,228 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:12:03,228 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:12:03,228 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-18 11:12:03,228 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:12:03,229 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:12:03,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,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-18 11:12:03,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-18 11:12:03,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-18 11:12:03,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-18 11:12:03,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:12:03,604 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:12:03,604 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:12:03,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:12:03,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:12:03,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:12:03,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:12:03,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 11:12:03,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,685 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:12:03,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,686 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:12:03,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:12:03,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-18 11:12:03,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:12:03,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:12:03,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:12:03,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:12:03,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:12:03,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:12:03,703 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:12:03,708 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:12:03,708 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:12:03,709 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:12:03,709 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:12:03,710 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:12:03,710 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2018-11-18 11:12:03,764 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-11-18 11:12:03,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:03,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:12:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:03,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:12:03,809 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-18 11:12:03,809 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 11:12:03,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 164 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-11-18 11:12:03,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 164 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 292 states and 385 transitions. Complement of second has 11 states. [2018-11-18 11:12:03,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 11:12:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:12:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-18 11:12:03,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 78 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-18 11:12:03,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:03,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 78 transitions. Stem has 28 letters. Loop has 6 letters. [2018-11-18 11:12:03,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:03,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 78 transitions. Stem has 22 letters. Loop has 12 letters. [2018-11-18 11:12:03,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:12:03,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 385 transitions. [2018-11-18 11:12:03,865 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2018-11-18 11:12:03,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 186 states and 244 transitions. [2018-11-18 11:12:03,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 11:12:03,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 11:12:03,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 244 transitions. [2018-11-18 11:12:03,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:03,866 INFO L705 BuchiCegarLoop]: Abstraction has 186 states and 244 transitions. [2018-11-18 11:12:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 244 transitions. [2018-11-18 11:12:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 131. [2018-11-18 11:12:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 11:12:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 171 transitions. [2018-11-18 11:12:03,870 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 171 transitions. [2018-11-18 11:12:03,870 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 171 transitions. [2018-11-18 11:12:03,871 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 11:12:03,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 171 transitions. [2018-11-18 11:12:03,871 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 11:12:03,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:03,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:03,872 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, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:03,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:12:03,872 INFO L794 eck$LassoCheckResult]: Stem: 2242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2213#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2214#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2230#L55 assume parse_expression_list_#t~switch3; 2315#L56-6 assume true; 2314#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2312#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2310#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 2308#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2306#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2303#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2302#L59-9 assume true; 2300#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2298#L59-2 assume !parse_expression_list_#t~short13; 2296#L59-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 2293#L59-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 2292#L60 assume !parse_expression_list_#t~short16; 2289#L60-2 assume parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post17 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post17 - 1;havoc parse_expression_list_#t~post17; 2286#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2282#L4 assume !(0 == __VERIFIER_assert_~cond); 2279#L4-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2276#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2275#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2274#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2272#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2270#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2268#L55 assume parse_expression_list_#t~switch3; 2241#L56-6 [2018-11-18 11:12:03,872 INFO L796 eck$LassoCheckResult]: Loop: 2241#L56-6 assume true; 2267#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2220#L56-2 assume parse_expression_list_#t~short6; 2221#L56-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 2241#L56-6 [2018-11-18 11:12:03,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1349246456, now seen corresponding path program 1 times [2018-11-18 11:12:03,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:03,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:03,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:03,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:03,888 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-18 11:12:03,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:03,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:12:03,888 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:12:03,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1479723, now seen corresponding path program 3 times [2018-11-18 11:12:03,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:03,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:03,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:03,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:03,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:12:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:12:03,924 INFO L87 Difference]: Start difference. First operand 131 states and 171 transitions. cyclomatic complexity: 49 Second operand 3 states. [2018-11-18 11:12:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:03,934 INFO L93 Difference]: Finished difference Result 135 states and 174 transitions. [2018-11-18 11:12:03,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:12:03,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 174 transitions. [2018-11-18 11:12:03,939 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 11:12:03,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 134 states and 173 transitions. [2018-11-18 11:12:03,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 11:12:03,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 11:12:03,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 173 transitions. [2018-11-18 11:12:03,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:03,940 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 173 transitions. [2018-11-18 11:12:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 173 transitions. [2018-11-18 11:12:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-11-18 11:12:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 11:12:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-11-18 11:12:03,944 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-11-18 11:12:03,944 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-11-18 11:12:03,944 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 11:12:03,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 171 transitions. [2018-11-18 11:12:03,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 11:12:03,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:03,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:03,946 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, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:03,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:12:03,946 INFO L794 eck$LassoCheckResult]: Stem: 2514#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2489#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2485#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2486#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2501#L55 assume parse_expression_list_#t~switch3; 2577#L56-6 assume true; 2573#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2570#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2567#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 2565#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2563#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2561#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2559#L59-9 assume true; 2557#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2555#L59-2 assume !parse_expression_list_#t~short13; 2552#L59-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 2549#L59-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 2546#L60 assume parse_expression_list_#t~short16;call parse_expression_list_#t~mem15 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 34 == parse_expression_list_#t~mem15; 2544#L60-2 assume parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post17 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post17 - 1;havoc parse_expression_list_#t~post17; 2542#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2525#L4 assume !(0 == __VERIFIER_assert_~cond); 2526#L4-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2512#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2513#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2541#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2540#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2539#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2537#L55 assume parse_expression_list_#t~switch3; 2508#L56-6 [2018-11-18 11:12:03,946 INFO L796 eck$LassoCheckResult]: Loop: 2508#L56-6 assume true; 2496#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2492#L56-2 assume parse_expression_list_#t~short6; 2493#L56-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 2508#L56-6 [2018-11-18 11:12:03,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash 648181878, now seen corresponding path program 1 times [2018-11-18 11:12:03,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:03,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:03,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:03,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:03,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:03,978 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-18 11:12:03,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:03,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:12:03,979 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:12:03,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1479723, now seen corresponding path program 4 times [2018-11-18 11:12:03,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:03,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:03,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:03,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:03,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:04,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:12:04,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:12:04,023 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-11-18 11:12:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:04,074 INFO L93 Difference]: Finished difference Result 158 states and 203 transitions. [2018-11-18 11:12:04,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:12:04,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 203 transitions. [2018-11-18 11:12:04,075 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 11:12:04,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 158 states and 203 transitions. [2018-11-18 11:12:04,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 11:12:04,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 11:12:04,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 203 transitions. [2018-11-18 11:12:04,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:04,077 INFO L705 BuchiCegarLoop]: Abstraction has 158 states and 203 transitions. [2018-11-18 11:12:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 203 transitions. [2018-11-18 11:12:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2018-11-18 11:12:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-18 11:12:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 170 transitions. [2018-11-18 11:12:04,080 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 170 transitions. [2018-11-18 11:12:04,080 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 170 transitions. [2018-11-18 11:12:04,080 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 11:12:04,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 170 transitions. [2018-11-18 11:12:04,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 11:12:04,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:04,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:04,082 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, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:04,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:12:04,082 INFO L794 eck$LassoCheckResult]: Stem: 2819#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2791#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2787#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2788#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2805#L55 assume parse_expression_list_#t~switch3; 2878#L56-6 assume true; 2877#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2876#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2875#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 2874#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2873#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2872#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2871#L59-9 assume true; 2870#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2869#L59-2 assume !parse_expression_list_#t~short13; 2868#L59-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 2867#L59-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 2866#L60 assume !parse_expression_list_#t~short16; 2834#L60-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 2800#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2801#L4 assume !(0 == __VERIFIER_assert_~cond); 2825#L4-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2817#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2818#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2856#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2854#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2853#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2850#L55 assume parse_expression_list_#t~switch3; 2812#L56-6 [2018-11-18 11:12:04,082 INFO L796 eck$LassoCheckResult]: Loop: 2812#L56-6 assume true; 2798#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2794#L56-2 assume parse_expression_list_#t~short6; 2795#L56-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 2812#L56-6 [2018-11-18 11:12:04,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:04,082 INFO L82 PathProgramCache]: Analyzing trace with hash 956219446, now seen corresponding path program 1 times [2018-11-18 11:12:04,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:04,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:04,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:04,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:04,108 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-18 11:12:04,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:04,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:12:04,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:12:04,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1479723, now seen corresponding path program 5 times [2018-11-18 11:12:04,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:04,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:04,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:04,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:04,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:12:04,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:12:04,146 INFO L87 Difference]: Start difference. First operand 133 states and 170 transitions. cyclomatic complexity: 46 Second operand 6 states. [2018-11-18 11:12:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:04,204 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2018-11-18 11:12:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:12:04,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 149 transitions. [2018-11-18 11:12:04,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:04,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 134 transitions. [2018-11-18 11:12:04,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 11:12:04,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 11:12:04,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 134 transitions. [2018-11-18 11:12:04,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:04,206 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 134 transitions. [2018-11-18 11:12:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 134 transitions. [2018-11-18 11:12:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-11-18 11:12:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 11:12:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2018-11-18 11:12:04,208 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 130 transitions. [2018-11-18 11:12:04,208 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 130 transitions. [2018-11-18 11:12:04,208 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 11:12:04,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 130 transitions. [2018-11-18 11:12:04,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:04,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:04,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:04,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 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] [2018-11-18 11:12:04,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:12:04,209 INFO L794 eck$LassoCheckResult]: Stem: 3084#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3056#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 3051#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3052#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3068#L55 assume !parse_expression_list_#t~switch3; 3087#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 3138#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3137#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3069#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3070#L55 assume parse_expression_list_#t~switch3; 3078#L56-6 assume true; 3079#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3136#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 3135#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 3073#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3074#L57 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 3120#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3118#L59-9 assume true; 3116#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 3111#L59-2 assume !parse_expression_list_#t~short13; 3108#L59-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 3105#L59-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 3102#L60 assume !parse_expression_list_#t~short16; 3098#L60-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 3044#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3065#L4 assume !(0 == __VERIFIER_assert_~cond); 3090#L4-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 3081#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3057#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 3058#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3082#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3097#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3095#L55 assume parse_expression_list_#t~switch3; 3077#L56-6 [2018-11-18 11:12:04,209 INFO L796 eck$LassoCheckResult]: Loop: 3077#L56-6 assume true; 3063#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3059#L56-2 assume parse_expression_list_#t~short6; 3060#L56-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 3077#L56-6 [2018-11-18 11:12:04,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1820426798, now seen corresponding path program 1 times [2018-11-18 11:12:04,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:04,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:04,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:12:04,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:04,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:12:04,255 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:12:04,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1479723, now seen corresponding path program 6 times [2018-11-18 11:12:04,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:04,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:12:04,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:12:04,288 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. cyclomatic complexity: 37 Second operand 8 states. [2018-11-18 11:12:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:04,404 INFO L93 Difference]: Finished difference Result 182 states and 237 transitions. [2018-11-18 11:12:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:12:04,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 237 transitions. [2018-11-18 11:12:04,406 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 11:12:04,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 157 states and 204 transitions. [2018-11-18 11:12:04,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 11:12:04,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 11:12:04,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 204 transitions. [2018-11-18 11:12:04,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:12:04,407 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 204 transitions. [2018-11-18 11:12:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 204 transitions. [2018-11-18 11:12:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2018-11-18 11:12:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 11:12:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2018-11-18 11:12:04,409 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 160 transitions. [2018-11-18 11:12:04,409 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 160 transitions. [2018-11-18 11:12:04,409 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 11:12:04,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 160 transitions. [2018-11-18 11:12:04,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:12:04,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:12:04,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:12:04,411 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 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] [2018-11-18 11:12:04,411 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:12:04,411 INFO L794 eck$LassoCheckResult]: Stem: 3391#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3361#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 3356#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3357#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3373#L55 assume !parse_expression_list_#t~switch3; 3394#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 3387#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3388#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3374#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3375#L55 assume parse_expression_list_#t~switch3; 3383#L56-6 assume true; 3384#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3470#L56-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 3389#L56-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 3390#L56-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3458#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 3457#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3456#L59-9 assume true; 3455#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 3418#L59-2 assume !parse_expression_list_#t~short13; 3417#L59-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 3416#L59-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 3413#L60 assume !parse_expression_list_#t~short16; 3410#L60-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 3349#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3370#L4 assume !(0 == __VERIFIER_assert_~cond); 3398#L4-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 3385#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3386#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 3409#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3408#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3407#L52-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3405#L55 assume parse_expression_list_#t~switch3; 3382#L56-6 [2018-11-18 11:12:04,411 INFO L796 eck$LassoCheckResult]: Loop: 3382#L56-6 assume true; 3368#L56-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3364#L56-2 assume parse_expression_list_#t~short6; 3365#L56-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 3382#L56-6 [2018-11-18 11:12:04,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash -173717908, now seen corresponding path program 1 times [2018-11-18 11:12:04,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:04,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:12:04,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 11:12:04,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:12:04,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41a0a214-9aa7-4968-8873-bcb5f1cf20b3/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-18 11:12:04,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:04,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:12:04,591 INFO L477 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 5 treesize of output 1 [2018-11-18 11:12:04,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:04,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:04,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-18 11:12:04,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 11:12:04,690 INFO L477 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 14 treesize of output 13 [2018-11-18 11:12:04,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:04,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:04,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 11:12:04,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2018-11-18 11:12:04,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-18 11:12:04,759 INFO L477 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 1 [2018-11-18 11:12:04,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:04,764 INFO L477 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 15 treesize of output 3 [2018-11-18 11:12:04,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:04,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:04,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:04,769 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2018-11-18 11:12:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 11:12:04,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:12:04,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-18 11:12:04,793 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:12:04,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1479723, now seen corresponding path program 7 times [2018-11-18 11:12:04,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:12:04,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:12:04,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 11:12:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:12:04,826 INFO L87 Difference]: Start difference. First operand 123 states and 160 transitions. cyclomatic complexity: 44 Second operand 16 states. [2018-11-18 11:12:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:05,108 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-18 11:12:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:12:05,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 101 transitions. [2018-11-18 11:12:05,109 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:12:05,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 0 states and 0 transitions. [2018-11-18 11:12:05,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:12:05,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:12:05,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:12:05,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:12:05,109 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:12:05,109 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:12:05,109 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:12:05,110 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 11:12:05,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:12:05,110 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:12:05,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:12:05,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:12:05 BoogieIcfgContainer [2018-11-18 11:12:05,115 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:12:05,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:12:05,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:12:05,117 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:12:05,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:11:58" (3/4) ... [2018-11-18 11:12:05,120 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:12:05,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:12:05,121 INFO L168 Benchmark]: Toolchain (without parser) took 7182.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.2 MB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:05,121 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:12:05,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:05,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:05,122 INFO L168 Benchmark]: Boogie Preprocessor took 23.20 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:05,123 INFO L168 Benchmark]: RCFGBuilder took 358.43 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:05,123 INFO L168 Benchmark]: BuchiAutomizer took 6512.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.4 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:05,124 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:12:05,126 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 200.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.20 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 358.43 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6512.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.4 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (10 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * str + unknown-#length-unknown[str] + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * start + -1 * str and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 10 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 14 iterations. TraceHistogramMax:3. Analysis of lassos took 4.8s. Construction of modules took 0.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 291 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 133 states and ocurred in iteration 10. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 434 SDtfs, 829 SDslu, 889 SDs, 0 SdLazy, 765 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU6 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital147 mio100 ax100 hnf101 lsp89 ukn73 mio100 lsp44 div100 bol100 ite100 ukn100 eq187 hnf86 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...