./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f5357e64289d6bac41f74df7b40a85eebbaa806 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:44,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:44,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:44,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:44,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:44,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:44,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:44,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:44,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:44,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:44,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:44,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:44,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:44,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:44,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:44,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:44,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:44,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:44,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:44,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:44,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:44,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:44,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:44,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:44,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:44,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:44,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:44,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:44,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:44,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:44,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:44,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:44,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:44,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:44,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:44,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:44,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:44,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:44,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:44,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:44,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:44,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:44,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:44,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:44,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:44,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:44,659 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:44,659 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:44,659 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:44,662 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:44,662 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:44,662 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:44,662 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:44,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:44,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:44,663 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:44,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:44,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:44,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:44,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:44,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:44,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:44,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:44,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:44,664 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:44,664 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:44,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:44,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:44,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:44,665 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:44,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:44,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:44,665 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:44,666 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:44,666 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2019-10-22 09:00:44,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:44,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:44,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:44,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:44,723 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:44,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/../../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-10-22 09:00:44,786 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/data/cb9cb98d6/4609644ce4da4f7e9966eca55559600f/FLAGd59eed91e [2019-10-22 09:00:45,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:45,169 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-10-22 09:00:45,178 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/data/cb9cb98d6/4609644ce4da4f7e9966eca55559600f/FLAGd59eed91e [2019-10-22 09:00:45,504 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/data/cb9cb98d6/4609644ce4da4f7e9966eca55559600f [2019-10-22 09:00:45,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:45,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:45,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:45,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:45,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:45,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a85410e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45, skipping insertion in model container [2019-10-22 09:00:45,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:45,540 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:45,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:45,790 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:45,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:45,842 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:45,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45 WrapperNode [2019-10-22 09:00:45,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:45,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:45,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:45,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:45,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:45,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:45,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:45,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:45,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:45,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:45,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:45,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:45,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-10-22 09:00:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:45,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:46,277 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:46,277 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-22 09:00:46,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:46 BoogieIcfgContainer [2019-10-22 09:00:46,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:46,279 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:46,279 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:46,282 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:46,283 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:46,283 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:45" (1/3) ... [2019-10-22 09:00:46,284 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32d08637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:46, skipping insertion in model container [2019-10-22 09:00:46,284 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:46,284 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (2/3) ... [2019-10-22 09:00:46,285 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32d08637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:46, skipping insertion in model container [2019-10-22 09:00:46,285 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:46,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:46" (3/3) ... [2019-10-22 09:00:46,287 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-10-22 09:00:46,322 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:46,322 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:46,323 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:46,323 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:46,323 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:46,323 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:46,323 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:46,324 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:46,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-10-22 09:00:46,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-10-22 09:00:46,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:46,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:46,364 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:00:46,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:46,365 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:46,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-10-22 09:00:46,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-10-22 09:00:46,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:46,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:46,367 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:00:46,367 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:46,372 INFO L791 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 25#L50true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L51-4true [2019-10-22 09:00:46,372 INFO L793 eck$LassoCheckResult]: Loop: 3#L51-4true parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 11#L54true assume !parse_expression_list_#t~switch4; 29#L53true havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 8#L51-1true call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L51-2true assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3#L51-4true [2019-10-22 09:00:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 09:00:46,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:46,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662768065] [2019-10-22 09:00:46,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,494 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2019-10-22 09:00:46,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:46,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919769155] [2019-10-22 09:00:46,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,510 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2019-10-22 09:00:46,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:46,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179090997] [2019-10-22 09:00:46,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:46,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:46,551 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:46,817 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-10-22 09:00:46,891 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:46,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:46,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:46,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:46,892 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:46,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:46,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:46,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:46,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2019-10-22 09:00:46,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:46,893 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:46,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:46,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:47,504 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:00:47,580 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:47,585 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:47,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,591 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,594 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,598 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,598 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,599 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,599 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,601 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,604 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,604 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,609 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,609 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,609 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,609 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,610 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,610 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,612 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,613 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,613 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,617 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,617 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,628 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,632 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,632 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,637 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,641 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,642 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,646 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,647 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:47,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,673 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,673 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,680 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,681 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:47,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,687 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:47,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,688 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:47,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:47,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,694 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,712 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:47,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,718 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:47,718 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,767 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,776 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,776 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:47,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:47,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:47,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:47,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:47,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:47,791 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:47,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:47,849 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:47,866 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:47,866 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:47,869 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:47,870 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:47,871 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:47,871 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2019-10-22 09:00:47,886 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:00:47,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:47,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:47,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:47,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:47,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:47,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:47,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-10-22 09:00:48,045 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 99 states and 138 transitions. Complement of second has 5 states. [2019-10-22 09:00:48,046 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 [2019-10-22 09:00:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2019-10-22 09:00:48,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 5 letters. [2019-10-22 09:00:48,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:48,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 5 letters. [2019-10-22 09:00:48,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:48,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 10 letters. [2019-10-22 09:00:48,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:48,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 138 transitions. [2019-10-22 09:00:48,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:48,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 40 states and 55 transitions. [2019-10-22 09:00:48,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:48,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:00:48,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2019-10-22 09:00:48,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:48,064 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-10-22 09:00:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2019-10-22 09:00:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-22 09:00:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 09:00:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-10-22 09:00:48,089 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-10-22 09:00:48,089 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-10-22 09:00:48,089 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:48,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2019-10-22 09:00:48,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:48,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:48,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:48,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:48,091 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:48,091 INFO L791 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 221#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 222#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 204#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 205#L54 assume parse_expression_list_#t~switch4; 214#L55-5 [2019-10-22 09:00:48,091 INFO L793 eck$LassoCheckResult]: Loop: 214#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 215#L55-1 assume parse_expression_list_#t~short7; 219#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 214#L55-5 [2019-10-22 09:00:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2019-10-22 09:00:48,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670870583] [2019-10-22 09:00:48,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,113 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-10-22 09:00:48,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070105302] [2019-10-22 09:00:48,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,122 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2019-10-22 09:00:48,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028643269] [2019-10-22 09:00:48,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:48,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028643269] [2019-10-22 09:00:48,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:48,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:00:48,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003291344] [2019-10-22 09:00:48,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:48,338 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-10-22 09:00:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:48,485 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-10-22 09:00:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:00:48,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2019-10-22 09:00:48,488 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-10-22 09:00:48,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2019-10-22 09:00:48,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 09:00:48,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-10-22 09:00:48,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2019-10-22 09:00:48,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:48,490 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-10-22 09:00:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2019-10-22 09:00:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-10-22 09:00:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 09:00:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-10-22 09:00:48,498 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-10-22 09:00:48,498 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-10-22 09:00:48,498 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:48,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2019-10-22 09:00:48,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:48,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:48,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:48,504 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:48,504 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:48,504 INFO L791 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 345#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 346#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 327#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 328#L54 assume !parse_expression_list_#t~switch4; 337#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 342#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 331#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 329#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 330#L54 assume parse_expression_list_#t~switch4; 338#L55-5 [2019-10-22 09:00:48,504 INFO L793 eck$LassoCheckResult]: Loop: 338#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 339#L55-1 assume parse_expression_list_#t~short7; 372#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 338#L55-5 [2019-10-22 09:00:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2019-10-22 09:00:48,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787805366] [2019-10-22 09:00:48,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,526 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-10-22 09:00:48,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150293909] [2019-10-22 09:00:48,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,535 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:48,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2019-10-22 09:00:48,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:48,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837364439] [2019-10-22 09:00:48,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:48,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:48,560 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:48,831 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-10-22 09:00:48,917 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:48,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:48,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:48,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:48,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:48,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:48,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:48,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:48,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2019-10-22 09:00:48,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:48,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:48,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:48,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,090 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-22 09:00:49,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:49,474 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:00:49,495 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:49,495 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:49,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,496 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,497 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,497 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,505 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,507 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,508 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,509 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,509 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,511 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,515 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,516 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,517 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,517 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,518 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,518 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,519 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,519 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,524 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,524 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,537 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,541 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,541 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,550 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:49,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,551 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:49,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:49,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,554 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,554 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,563 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,564 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,573 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,574 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,588 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,588 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:49,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:49,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:49,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:49,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:49,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:49,600 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:49,601 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:49,626 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:49,649 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:00:49,651 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:00:49,651 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:49,652 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:49,653 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:49,653 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset, 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 + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 Supporting invariants [] [2019-10-22 09:00:49,672 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 09:00:49,673 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:49,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:49,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:49,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:49,727 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:49,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-10-22 09:00:49,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 153 states and 213 transitions. Complement of second has 7 states. [2019-10-22 09:00:49,793 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 [2019-10-22 09:00:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2019-10-22 09:00:49,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 09:00:49,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:49,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 09:00:49,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:49,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 09:00:49,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:49,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2019-10-22 09:00:49,796 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-10-22 09:00:49,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2019-10-22 09:00:49,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-10-22 09:00:49,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-10-22 09:00:49,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2019-10-22 09:00:49,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:49,802 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2019-10-22 09:00:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2019-10-22 09:00:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-10-22 09:00:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 09:00:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-10-22 09:00:49,810 INFO L711 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-10-22 09:00:49,811 INFO L591 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-10-22 09:00:49,811 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:49,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2019-10-22 09:00:49,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:49,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:49,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:49,812 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:49,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:49,812 INFO L791 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 646#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 647#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 625#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 626#L54 assume parse_expression_list_#t~switch4; 654#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 695#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 693#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7; 645#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 690#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 655#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 656#L58-8 [2019-10-22 09:00:49,812 INFO L793 eck$LassoCheckResult]: Loop: 656#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 663#L58-1 assume !parse_expression_list_#t~short14; 649#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 656#L58-8 [2019-10-22 09:00:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 1 times [2019-10-22 09:00:49,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:49,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925221477] [2019-10-22 09:00:49,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:49,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:49,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:50,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925221477] [2019-10-22 09:00:50,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:50,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:00:50,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910052278] [2019-10-22 09:00:50,030 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,030 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2019-10-22 09:00:50,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909521588] [2019-10-22 09:00:50,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:50,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909521588] [2019-10-22 09:00:50,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:50,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:50,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299900626] [2019-10-22 09:00:50,039 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:50,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:50,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:50,040 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-10-22 09:00:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:50,052 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-10-22 09:00:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:50,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-10-22 09:00:50,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:50,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2019-10-22 09:00:50,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 09:00:50,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-10-22 09:00:50,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2019-10-22 09:00:50,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:50,057 INFO L688 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-10-22 09:00:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2019-10-22 09:00:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-22 09:00:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 09:00:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-10-22 09:00:50,061 INFO L711 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-10-22 09:00:50,061 INFO L591 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-10-22 09:00:50,061 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:50,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2019-10-22 09:00:50,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:50,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:50,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:50,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:50,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:50,062 INFO L791 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 802#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 803#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 782#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 783#L54 assume parse_expression_list_#t~switch4; 794#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 795#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 800#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7; 787#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 788#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 806#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 807#L58-8 [2019-10-22 09:00:50,062 INFO L793 eck$LassoCheckResult]: Loop: 807#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 819#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 816#L58-2 assume parse_expression_list_#t~short13; 810#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 811#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 807#L58-8 [2019-10-22 09:00:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 2 times [2019-10-22 09:00:50,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822083791] [2019-10-22 09:00:50,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:50,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822083791] [2019-10-22 09:00:50,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:50,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:00:50,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463738200] [2019-10-22 09:00:50,242 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,242 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2019-10-22 09:00:50,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760974517] [2019-10-22 09:00:50,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,249 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:50,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:50,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:50,316 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 7 states. [2019-10-22 09:00:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:50,420 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-10-22 09:00:50,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:50,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2019-10-22 09:00:50,425 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-10-22 09:00:50,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 97 states and 130 transitions. [2019-10-22 09:00:50,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-10-22 09:00:50,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-10-22 09:00:50,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 130 transitions. [2019-10-22 09:00:50,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:50,427 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 130 transitions. [2019-10-22 09:00:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 130 transitions. [2019-10-22 09:00:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2019-10-22 09:00:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 09:00:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2019-10-22 09:00:50,431 INFO L711 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2019-10-22 09:00:50,431 INFO L591 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2019-10-22 09:00:50,431 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:50,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 96 transitions. [2019-10-22 09:00:50,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:50,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:50,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:50,433 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:50,433 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:50,433 INFO L791 eck$LassoCheckResult]: Stem: 1017#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 992#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 993#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 972#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 973#L54 assume parse_expression_list_#t~switch4; 984#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 985#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 990#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7; 978#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 979#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 997#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 998#L58-8 [2019-10-22 09:00:50,433 INFO L793 eck$LassoCheckResult]: Loop: 998#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1009#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1006#L58-2 assume parse_expression_list_#t~short13; 1001#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1002#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 998#L58-8 [2019-10-22 09:00:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2019-10-22 09:00:50,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201465888] [2019-10-22 09:00:50,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,450 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,451 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2019-10-22 09:00:50,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476713442] [2019-10-22 09:00:50,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,458 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2019-10-22 09:00:50,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781995863] [2019-10-22 09:00:50,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:50,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781995863] [2019-10-22 09:00:50,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:50,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:00:50,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129911707] [2019-10-22 09:00:50,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:50,554 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. cyclomatic complexity: 33 Second operand 6 states. [2019-10-22 09:00:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:50,628 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2019-10-22 09:00:50,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:50,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 151 transitions. [2019-10-22 09:00:50,632 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 09:00:50,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 143 transitions. [2019-10-22 09:00:50,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 09:00:50,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 09:00:50,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 143 transitions. [2019-10-22 09:00:50,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:50,634 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 143 transitions. [2019-10-22 09:00:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 143 transitions. [2019-10-22 09:00:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-10-22 09:00:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 09:00:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2019-10-22 09:00:50,638 INFO L711 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2019-10-22 09:00:50,638 INFO L591 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2019-10-22 09:00:50,638 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:50,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 99 transitions. [2019-10-22 09:00:50,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:50,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:50,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:50,640 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:50,640 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:50,640 INFO L791 eck$LassoCheckResult]: Stem: 1219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1193#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 1194#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1173#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1174#L54 assume !parse_expression_list_#t~switch4; 1196#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1237#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1236#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1235#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1195#L54 assume parse_expression_list_#t~switch4; 1197#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 1187#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1191#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7; 1192#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1244#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 1199#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1200#L58-8 [2019-10-22 09:00:50,640 INFO L793 eck$LassoCheckResult]: Loop: 1200#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1212#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1209#L58-2 assume parse_expression_list_#t~short13; 1203#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1204#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1200#L58-8 [2019-10-22 09:00:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash -960269984, now seen corresponding path program 1 times [2019-10-22 09:00:50,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079493169] [2019-10-22 09:00:50,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,659 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2019-10-22 09:00:50,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725661177] [2019-10-22 09:00:50,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1965798457, now seen corresponding path program 1 times [2019-10-22 09:00:50,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135515533] [2019-10-22 09:00:50,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:50,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135515533] [2019-10-22 09:00:50,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657835140] [2019-10-22 09:00:50,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:50,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:50,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:50,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:50,776 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:50,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-22 09:00:50,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886782146] [2019-10-22 09:00:50,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:50,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:50,850 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. cyclomatic complexity: 32 Second operand 7 states. [2019-10-22 09:00:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:50,960 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2019-10-22 09:00:50,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:00:50,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 217 transitions. [2019-10-22 09:00:50,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-10-22 09:00:50,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 146 states and 195 transitions. [2019-10-22 09:00:50,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-10-22 09:00:50,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-10-22 09:00:50,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 195 transitions. [2019-10-22 09:00:50,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:50,963 INFO L688 BuchiCegarLoop]: Abstraction has 146 states and 195 transitions. [2019-10-22 09:00:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 195 transitions. [2019-10-22 09:00:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2019-10-22 09:00:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-22 09:00:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-10-22 09:00:50,968 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-10-22 09:00:50,968 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-10-22 09:00:50,968 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:50,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 151 transitions. [2019-10-22 09:00:50,969 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 09:00:50,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:50,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:50,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:50,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:50,969 INFO L791 eck$LassoCheckResult]: Stem: 1531#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1507#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 1508#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1489#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1490#L54 assume !parse_expression_list_#t~switch4; 1584#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1583#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1582#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1581#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1578#L54 assume !parse_expression_list_#t~switch4; 1544#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1600#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1549#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1548#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1543#L54 assume parse_expression_list_#t~switch4; 1545#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 1593#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1592#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7; 1494#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1495#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1510#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1511#L58-8 [2019-10-22 09:00:50,970 INFO L793 eck$LassoCheckResult]: Loop: 1511#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1524#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1521#L58-2 assume parse_expression_list_#t~short13; 1514#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1515#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1511#L58-8 [2019-10-22 09:00:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 1 times [2019-10-22 09:00:50,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45535694] [2019-10-22 09:00:50,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 4 times [2019-10-22 09:00:50,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:50,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264212758] [2019-10-22 09:00:50,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:50,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:50,998 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 1 times [2019-10-22 09:00:51,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:51,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088338897] [2019-10-22 09:00:51,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:51,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:51,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:51,025 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:51,451 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 121 [2019-10-22 09:00:51,539 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:51,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:51,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:51,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:51,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:51,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:51,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:51,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:51,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration8_Lasso [2019-10-22 09:00:51,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:51,540 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:51,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,767 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-10-22 09:00:51,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:51,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:52,210 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:52,210 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:52,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,214 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,214 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,214 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,216 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,217 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,219 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,221 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,223 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,224 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,224 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,225 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,226 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,226 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,227 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,228 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,228 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,230 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,230 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,232 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,232 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,233 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,233 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,234 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,234 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,236 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,240 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,244 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,244 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,246 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,246 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,249 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,249 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,251 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,251 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,251 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,251 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,252 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,252 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,253 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,253 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,254 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,255 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,255 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,255 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,257 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:52,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,257 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:52,257 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:52,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,258 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:52,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,259 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:52,260 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,264 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,266 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-10-22 09:00:52,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,268 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-10-22 09:00:52,268 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,273 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:52,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,275 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:52,275 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,283 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,283 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,285 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,286 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,286 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,289 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,294 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,294 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,294 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:52,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:52,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:52,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:52,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:52,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:52,298 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:52,298 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:52,316 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:52,329 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:52,329 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-10-22 09:00:52,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:52,330 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:52,331 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:52,331 INFO L512 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 [] [2019-10-22 09:00:52,368 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 09:00:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:52,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:52,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:52,425 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 [2019-10-22 09:00:52,425 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48 Second operand 4 states. [2019-10-22 09:00:52,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 267 states and 360 transitions. Complement of second has 11 states. [2019-10-22 09:00:52,511 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 [2019-10-22 09:00:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:00:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2019-10-22 09:00:52,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2019-10-22 09:00:52,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:52,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2019-10-22 09:00:52,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:52,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2019-10-22 09:00:52,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:52,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 360 transitions. [2019-10-22 09:00:52,515 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-10-22 09:00:52,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 170 states and 228 transitions. [2019-10-22 09:00:52,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-10-22 09:00:52,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 09:00:52,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 228 transitions. [2019-10-22 09:00:52,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:52,517 INFO L688 BuchiCegarLoop]: Abstraction has 170 states and 228 transitions. [2019-10-22 09:00:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 228 transitions. [2019-10-22 09:00:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2019-10-22 09:00:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-22 09:00:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2019-10-22 09:00:52,522 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2019-10-22 09:00:52,523 INFO L591 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2019-10-22 09:00:52,523 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:52,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 158 transitions. [2019-10-22 09:00:52,524 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 09:00:52,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:52,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:52,525 INFO L849 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] [2019-10-22 09:00:52,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:52,525 INFO L791 eck$LassoCheckResult]: Stem: 2090#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2062#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 2063#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2042#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2043#L54 assume parse_expression_list_#t~switch4; 2118#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 2117#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2116#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7; 2115#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2114#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2113#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2112#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2111#L58-1 assume !parse_expression_list_#t~short14; 2110#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13; 2109#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2108#L59 assume !parse_expression_list_#t~short17; 2107#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2106#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := 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 r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2105#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__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; 2104#L3 assume !(0 == __VERIFIER_assert_~cond); 2103#L3-2 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); 2102#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2101#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2100#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2099#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2098#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2096#L54 assume parse_expression_list_#t~switch4; 2059#L55-5 [2019-10-22 09:00:52,525 INFO L793 eck$LassoCheckResult]: Loop: 2059#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 2095#L55-1 assume parse_expression_list_#t~short7; 2058#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2059#L55-5 [2019-10-22 09:00:52,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2019-10-22 09:00:52,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:52,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246353619] [2019-10-22 09:00:52,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:52,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246353619] [2019-10-22 09:00:52,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:52,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:00:52,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478384491] [2019-10-22 09:00:52,562 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-10-22 09:00:52,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:52,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862008436] [2019-10-22 09:00:52,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:52,568 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:52,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:52,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:52,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:52,610 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-10-22 09:00:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:52,716 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-10-22 09:00:52,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:52,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2019-10-22 09:00:52,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:52,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 92 states and 123 transitions. [2019-10-22 09:00:52,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:52,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:52,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 123 transitions. [2019-10-22 09:00:52,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:52,718 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 123 transitions. [2019-10-22 09:00:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 123 transitions. [2019-10-22 09:00:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-10-22 09:00:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 09:00:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2019-10-22 09:00:52,721 INFO L711 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2019-10-22 09:00:52,721 INFO L591 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2019-10-22 09:00:52,721 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:52,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 119 transitions. [2019-10-22 09:00:52,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:00:52,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:52,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:52,723 INFO L849 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] [2019-10-22 09:00:52,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:52,724 INFO L791 eck$LassoCheckResult]: Stem: 2323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2299#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);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~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, 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.allocOnStack(2); 2300#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2280#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2281#L54 assume !parse_expression_list_#t~switch4; 2301#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2367#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2366#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2282#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2283#L54 assume parse_expression_list_#t~switch4; 2364#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 2362#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2360#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7; 2359#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2358#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2356#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2355#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2315#L58-1 assume !parse_expression_list_#t~short14; 2316#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13; 2329#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2328#L59 assume !parse_expression_list_#t~short17; 2326#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2324#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := 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 r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2321#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__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; 2313#L3 assume !(0 == __VERIFIER_assert_~cond); 2310#L3-2 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); 2290#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2291#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2292#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2284#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2285#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2327#L54 assume parse_expression_list_#t~switch4; 2293#L55-5 [2019-10-22 09:00:52,724 INFO L793 eck$LassoCheckResult]: Loop: 2293#L55-5 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~short7 := 32 == parse_expression_list_#t~mem5; 2294#L55-1 assume parse_expression_list_#t~short7; 2297#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2293#L55-5 [2019-10-22 09:00:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2019-10-22 09:00:52,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:52,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175597877] [2019-10-22 09:00:52,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:52,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175597877] [2019-10-22 09:00:52,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187063539] [2019-10-22 09:00:52,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2ac25307-f4b2-4b8d-83b7-9419a9de5604/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 09:00:52,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:52,940 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-22 09:00:52,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:52,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:52,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:00:52,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-10-22 09:00:53,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-10-22 09:00:53,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:53,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:53,093 INFO L496 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. [2019-10-22 09:00:53,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2019-10-22 09:00:53,149 INFO L375 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 10 [2019-10-22 09:00:53,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:53,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:53,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:00:53,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2019-10-22 09:00:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:53,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:53,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-10-22 09:00:53,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783503643] [2019-10-22 09:00:53,167 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,168 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-10-22 09:00:53,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998486555] [2019-10-22 09:00:53,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,174 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:53,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 09:00:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:00:53,220 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. cyclomatic complexity: 38 Second operand 15 states. [2019-10-22 09:00:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,631 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2019-10-22 09:00:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:00:53,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2019-10-22 09:00:53,632 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:53,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-10-22 09:00:53,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:53,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:53,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:53,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:53,633 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:53,633 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:53,633 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:53,633 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:53,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:53,633 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:53,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:53,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:53 BoogieIcfgContainer [2019-10-22 09:00:53,643 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:53,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:53,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:53,643 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:53,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:46" (3/4) ... [2019-10-22 09:00:53,647 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:53,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:53,648 INFO L168 Benchmark]: Toolchain (without parser) took 8141.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -239.6 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:53,649 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:53,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:53,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:53,650 INFO L168 Benchmark]: Boogie Preprocessor took 29.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:53,650 INFO L168 Benchmark]: RCFGBuilder took 371.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:53,651 INFO L168 Benchmark]: BuchiAutomizer took 7364.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:53,651 INFO L168 Benchmark]: Witness Printer took 4.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:53,653 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 371.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7364.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * start + -1 * str + unknown-#length-unknown[str] and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 7 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 5.7s. 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 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 221 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 312 SDtfs, 631 SDslu, 653 SDs, 0 SdLazy, 638 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf101 lsp91 ukn74 mio100 lsp40 div100 bol100 ite100 ukn100 eq183 hnf88 smp96 dnf260 smp72 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 5 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 14 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...