./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/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 8770e865452d763f6a1ae70a92c5caf41552c1e5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:43:45,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:43:45,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:43:45,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:43:45,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:43:45,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:43:45,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:43:45,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:43:45,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:43:45,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:43:45,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:43:45,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:43:45,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:43:45,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:43:45,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:43:45,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:43:45,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:43:45,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:43:45,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:43:45,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:43:45,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:43:45,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:43:45,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:43:45,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:43:45,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:43:45,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:43:45,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:43:45,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:43:45,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:43:45,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:43:45,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:43:45,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:43:45,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:43:45,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:43:45,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:43:45,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:43:45,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:43:45,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:43:45,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:43:45,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:43:45,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:43:45,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 00:43:45,306 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:43:45,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:43:45,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:43:45,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:43:45,309 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:43:45,309 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:43:45,309 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:43:45,310 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:43:45,310 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:43:45,310 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:43:45,311 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:43:45,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:43:45,312 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:43:45,312 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:43:45,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:43:45,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:43:45,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:43:45,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:43:45,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:43:45,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:43:45,314 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:43:45,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:43:45,314 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:43:45,315 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:43:45,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:43:45,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:43:45,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:43:45,316 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:43:45,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:43:45,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:43:45,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:43:45,318 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:43:45,320 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:43:45,320 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/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 -> 8770e865452d763f6a1ae70a92c5caf41552c1e5 [2020-11-30 00:43:45,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:43:45,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:43:45,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:43:45,710 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:43:45,716 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:43:45,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/../../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-11-30 00:43:45,800 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/data/e7af68728/7868821ffa11452dabfa29c0b013add1/FLAG234907d40 [2020-11-30 00:43:46,420 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:43:46,421 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-11-30 00:43:46,438 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/data/e7af68728/7868821ffa11452dabfa29c0b013add1/FLAG234907d40 [2020-11-30 00:43:46,707 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/data/e7af68728/7868821ffa11452dabfa29c0b013add1 [2020-11-30 00:43:46,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:43:46,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:43:46,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:43:46,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:43:46,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:43:46,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:43:46" (1/1) ... [2020-11-30 00:43:46,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3feff18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:46, skipping insertion in model container [2020-11-30 00:43:46,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:43:46" (1/1) ... [2020-11-30 00:43:46,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:43:46,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:43:47,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:43:47,043 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:43:47,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:43:47,099 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:43:47,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47 WrapperNode [2020-11-30 00:43:47,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:43:47,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:43:47,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:43:47,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:43:47,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:43:47,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:43:47,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:43:47,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:43:47,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... [2020-11-30 00:43:47,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:43:47,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:43:47,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:43:47,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:43:47,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/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 [2020-11-30 00:43:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:43:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:43:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:43:47,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:43:47,281 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-11-30 00:43:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:43:47,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:43:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:43:48,045 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:43:48,046 INFO L298 CfgBuilder]: Removed 15 assume(true) statements. [2020-11-30 00:43:48,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:43:48 BoogieIcfgContainer [2020-11-30 00:43:48,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:43:48,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:43:48,050 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:43:48,054 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:43:48,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:43:48,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:43:46" (1/3) ... [2020-11-30 00:43:48,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60163dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:43:48, skipping insertion in model container [2020-11-30 00:43:48,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:43:48,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:43:47" (2/3) ... [2020-11-30 00:43:48,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60163dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:43:48, skipping insertion in model container [2020-11-30 00:43:48,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:43:48,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:43:48" (3/3) ... [2020-11-30 00:43:48,061 INFO L373 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-11-30 00:43:48,133 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:43:48,133 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:43:48,133 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:43:48,133 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:43:48,134 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:43:48,134 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:43:48,134 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:43:48,134 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:43:48,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-11-30 00:43:48,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-11-30 00:43:48,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:48,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:48,194 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 00:43:48,194 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:43:48,194 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:43:48,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-11-30 00:43:48,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-11-30 00:43:48,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:48,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:48,204 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 00:43:48,204 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:43:48,213 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 9#L-1true havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 28#L61true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L62-4true [2020-11-30 00:43:48,213 INFO L796 eck$LassoCheckResult]: Loop: 3#L62-4true parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 12#L65true assume !parse_expression_list_#t~switch7; 33#L64true havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 8#L62-1true call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L62-2true assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 3#L62-4true [2020-11-30 00:43:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:48,222 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-11-30 00:43:48,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:48,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36374811] [2020-11-30 00:43:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:48,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:48,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:48,417 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:48,419 INFO L82 PathProgramCache]: Analyzing trace with hash 42114609, now seen corresponding path program 1 times [2020-11-30 00:43:48,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:48,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524626715] [2020-11-30 00:43:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:48,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:48,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:48,442 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash 181442414, now seen corresponding path program 1 times [2020-11-30 00:43:48,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:48,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919797640] [2020-11-30 00:43:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:48,479 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:48,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:48,521 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:48,724 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-11-30 00:43:49,469 WARN L193 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2020-11-30 00:43:49,695 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-30 00:43:49,714 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:43:49,715 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:43:49,715 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:43:49,715 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:43:49,715 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:43:49,716 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:49,716 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:43:49,716 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:43:49,717 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2020-11-30 00:43:49,717 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:43:49,717 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:43:49,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:49,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:49,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:49,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:49,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:49,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:49,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:49,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:49,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,165 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-11-30 00:43:50,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:50,954 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:43:50,959 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:43:50,966 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 [2020-11-30 00:43:50,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:50,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:50,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:50,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:50,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:50,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:50,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:50,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,017 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 [2020-11-30 00:43:51,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:51,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:51,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:43:51,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,059 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 [2020-11-30 00:43:51,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:51,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:51,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:43:51,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,105 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 [2020-11-30 00:43:51,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:51,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,150 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 [2020-11-30 00:43:51,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:51,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:51,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:43:51,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:43:51,186 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 [2020-11-30 00:43:51,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:51,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:51,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,222 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 [2020-11-30 00:43:51,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:51,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:51,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:43:51,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,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 [2020-11-30 00:43:51,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:51,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,303 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 [2020-11-30 00:43:51,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:51,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,363 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 [2020-11-30 00:43:51,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:51,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,400 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 [2020-11-30 00:43:51,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:51,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,447 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 [2020-11-30 00:43:51,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:51,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:51,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:43:51,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,490 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 [2020-11-30 00:43:51,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:51,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,542 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 [2020-11-30 00:43:51,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:51,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:43:51,618 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 [2020-11-30 00:43:51,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:43:51,682 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 [2020-11-30 00:43:51,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:51,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:51,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:51,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:51,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:51,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:43:51,772 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-11-30 00:43:51,772 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:51,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:43:51,817 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:43:51,817 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:43:51,818 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~i~0) = -1*ULTIMATE.start_parse_expression_list_~str.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2020-11-30 00:43:52,020 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-11-30 00:43:52,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:43:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:52,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:43:52,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:43:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:52,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:43:52,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:43:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:43:52,214 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 [2020-11-30 00:43:52,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states. Second operand 3 states. [2020-11-30 00:43:52,342 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states.. Second operand 3 states. Result 103 states and 144 transitions. Complement of second has 5 states. [2020-11-30 00:43:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:43:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:43:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2020-11-30 00:43:52,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 3 letters. Loop has 5 letters. [2020-11-30 00:43:52,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:43:52,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 8 letters. Loop has 5 letters. [2020-11-30 00:43:52,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:43:52,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 3 letters. Loop has 10 letters. [2020-11-30 00:43:52,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:43:52,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 144 transitions. [2020-11-30 00:43:52,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:43:52,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 40 states and 55 transitions. [2020-11-30 00:43:52,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 00:43:52,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-30 00:43:52,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2020-11-30 00:43:52,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:43:52,376 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2020-11-30 00:43:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2020-11-30 00:43:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-11-30 00:43:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-30 00:43:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-11-30 00:43:52,408 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-11-30 00:43:52,408 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-11-30 00:43:52,408 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:43:52,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2020-11-30 00:43:52,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:43:52,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:52,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:52,410 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-30 00:43:52,411 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:43:52,411 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 273#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 274#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 258#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 259#L65 assume parse_expression_list_#t~switch7; 268#L66-5 [2020-11-30 00:43:52,411 INFO L796 eck$LassoCheckResult]: Loop: 268#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 269#L66-1 assume parse_expression_list_#t~short10; 293#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 268#L66-5 [2020-11-30 00:43:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:52,412 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2020-11-30 00:43:52,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:52,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002611292] [2020-11-30 00:43:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:52,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:52,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:52,475 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:52,476 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-11-30 00:43:52,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:52,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117584391] [2020-11-30 00:43:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:52,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:52,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:52,499 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2020-11-30 00:43:52,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:52,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444054724] [2020-11-30 00:43:52,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:43:52,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444054724] [2020-11-30 00:43:52,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:43:52,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:43:52,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93343071] [2020-11-30 00:43:52,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:43:52,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:43:52,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:43:52,908 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2020-11-30 00:43:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:43:53,124 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2020-11-30 00:43:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:43:53,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2020-11-30 00:43:53,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-11-30 00:43:53,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2020-11-30 00:43:53,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-11-30 00:43:53,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-11-30 00:43:53,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2020-11-30 00:43:53,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:43:53,134 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2020-11-30 00:43:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2020-11-30 00:43:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-11-30 00:43:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-30 00:43:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2020-11-30 00:43:53,147 INFO L714 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-11-30 00:43:53,147 INFO L594 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-11-30 00:43:53,147 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:43:53,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2020-11-30 00:43:53,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:43:53,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:53,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:53,150 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:43:53,150 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:43:53,150 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 397#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 398#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 381#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 382#L65 assume !parse_expression_list_#t~switch7; 391#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 396#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 385#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 383#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 384#L65 assume parse_expression_list_#t~switch7; 424#L66-5 [2020-11-30 00:43:53,151 INFO L796 eck$LassoCheckResult]: Loop: 424#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 425#L66-1 assume parse_expression_list_#t~short10; 426#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 424#L66-5 [2020-11-30 00:43:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1727498927, now seen corresponding path program 1 times [2020-11-30 00:43:53,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:53,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033921566] [2020-11-30 00:43:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:53,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:53,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:53,235 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:53,236 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-11-30 00:43:53,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:53,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643030019] [2020-11-30 00:43:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:53,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:53,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:53,264 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1622374614, now seen corresponding path program 1 times [2020-11-30 00:43:53,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:53,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69585121] [2020-11-30 00:43:53,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:53,311 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:53,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:53,353 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:54,265 WARN L193 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 108 [2020-11-30 00:43:54,537 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-30 00:43:54,541 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:43:54,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:43:54,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:43:54,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:43:54,541 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:43:54,541 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:54,541 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:43:54,541 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:43:54,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2020-11-30 00:43:54,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:43:54,542 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:43:54,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:54,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:54,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,085 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-11-30 00:43:55,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:55,834 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:43:55,841 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:43:55,852 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 [2020-11-30 00:43:55,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:55,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:55,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:55,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:55,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:55,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:55,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:55,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:55,918 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 [2020-11-30 00:43:55,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:55,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:43:55,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:55,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:55,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:55,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:43:55,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:43:55,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:55,959 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 [2020-11-30 00:43:55,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:55,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:55,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:55,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:55,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:55,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:55,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:43:56,019 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 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:56,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:56,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:56,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:56,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:56,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:56,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:56,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:56,054 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 [2020-11-30 00:43:56,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:43:56,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:43:56,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:43:56,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:43:56,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:43:56,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:43:56,085 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:43:56,135 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-11-30 00:43:56,135 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:43:56,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:56,145 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 00:43:56,145 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:43:56,145 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2, ULTIMATE.start_parse_expression_list_~start~0) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 Supporting invariants [1*ULTIMATE.start_parse_expression_list_~str.offset >= 0] [2020-11-30 00:43:56,264 INFO L297 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2020-11-30 00:43:56,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:43:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:56,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:43:56,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:43:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:56,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:43:56,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:43:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:43:56,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-11-30 00:43:56,424 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-11-30 00:43:56,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 153 states and 213 transitions. Complement of second has 8 states. [2020-11-30 00:43:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:43:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-30 00:43:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-11-30 00:43:56,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2020-11-30 00:43:56,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:43:56,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2020-11-30 00:43:56,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:43:56,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2020-11-30 00:43:56,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:43:56,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2020-11-30 00:43:56,571 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2020-11-30 00:43:56,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2020-11-30 00:43:56,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-11-30 00:43:56,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-11-30 00:43:56,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2020-11-30 00:43:56,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:43:56,581 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2020-11-30 00:43:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2020-11-30 00:43:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2020-11-30 00:43:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-30 00:43:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2020-11-30 00:43:56,593 INFO L714 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-11-30 00:43:56,593 INFO L594 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-11-30 00:43:56,593 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:43:56,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2020-11-30 00:43:56,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:43:56,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:56,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:56,595 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:43:56,595 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:43:56,595 INFO L794 eck$LassoCheckResult]: Stem: 802#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 774#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 775#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 754#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 755#L65 assume parse_expression_list_#t~switch7; 766#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 768#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 798#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9; 799#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 788#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 783#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 777#L69-8 [2020-11-30 00:43:56,596 INFO L796 eck$LassoCheckResult]: Loop: 777#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 793#L69-1 assume !parse_expression_list_#t~short17; 776#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 777#L69-8 [2020-11-30 00:43:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2020-11-30 00:43:56,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:56,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268663028] [2020-11-30 00:43:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:56,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:56,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:56,640 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:56,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2020-11-30 00:43:56,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:56,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951238616] [2020-11-30 00:43:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:43:56,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951238616] [2020-11-30 00:43:56,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:43:56,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:43:56,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581035373] [2020-11-30 00:43:56,670 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:43:56,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:43:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:43:56,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:43:56,671 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2020-11-30 00:43:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:43:56,685 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2020-11-30 00:43:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:43:56,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2020-11-30 00:43:56,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:43:56,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2020-11-30 00:43:56,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-11-30 00:43:56,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-11-30 00:43:56,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2020-11-30 00:43:56,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:43:56,692 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-11-30 00:43:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2020-11-30 00:43:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-11-30 00:43:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-30 00:43:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2020-11-30 00:43:56,699 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-11-30 00:43:56,699 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-11-30 00:43:56,699 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:43:56,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2020-11-30 00:43:56,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:43:56,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:56,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:56,701 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:43:56,701 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:43:56,701 INFO L794 eck$LassoCheckResult]: Stem: 949#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 924#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 925#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 906#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 907#L65 assume parse_expression_list_#t~switch7; 973#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 950#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 947#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9; 910#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 911#L67 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 931#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 927#L69-8 [2020-11-30 00:43:56,702 INFO L796 eck$LassoCheckResult]: Loop: 927#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 942#L69-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 939#L69-2 assume parse_expression_list_#t~short16; 934#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 926#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 927#L69-8 [2020-11-30 00:43:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:56,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 1 times [2020-11-30 00:43:56,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:56,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404470192] [2020-11-30 00:43:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:43:56,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404470192] [2020-11-30 00:43:56,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:43:56,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:43:56,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728604368] [2020-11-30 00:43:56,859 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:43:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:56,859 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2020-11-30 00:43:56,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:56,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492848526] [2020-11-30 00:43:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:56,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:56,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:56,869 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:56,999 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2020-11-30 00:43:57,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:43:57,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:43:57,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:43:57,022 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 6 states. [2020-11-30 00:43:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:43:57,189 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2020-11-30 00:43:57,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:43:57,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2020-11-30 00:43:57,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-11-30 00:43:57,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 97 states and 130 transitions. [2020-11-30 00:43:57,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-11-30 00:43:57,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-11-30 00:43:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 130 transitions. [2020-11-30 00:43:57,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:43:57,194 INFO L691 BuchiCegarLoop]: Abstraction has 97 states and 130 transitions. [2020-11-30 00:43:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 130 transitions. [2020-11-30 00:43:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2020-11-30 00:43:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:43:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2020-11-30 00:43:57,209 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2020-11-30 00:43:57,209 INFO L594 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2020-11-30 00:43:57,209 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:43:57,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 96 transitions. [2020-11-30 00:43:57,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:43:57,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:57,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:57,213 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:43:57,213 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:43:57,213 INFO L794 eck$LassoCheckResult]: Stem: 1137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1116#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 1117#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1095#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1096#L65 assume parse_expression_list_#t~switch7; 1107#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 1108#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 1134#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9; 1099#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1100#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 1121#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1113#L69-8 [2020-11-30 00:43:57,214 INFO L796 eck$LassoCheckResult]: Loop: 1113#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1129#L69-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 1126#L69-2 assume parse_expression_list_#t~short16; 1118#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1112#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 1113#L69-8 [2020-11-30 00:43:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 2 times [2020-11-30 00:43:57,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:57,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047992247] [2020-11-30 00:43:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:57,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:57,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:57,258 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2020-11-30 00:43:57,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:57,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388449219] [2020-11-30 00:43:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:57,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:57,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:57,271 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2020-11-30 00:43:57,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:57,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598952161] [2020-11-30 00:43:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:43:57,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598952161] [2020-11-30 00:43:57,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:43:57,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:43:57,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116465568] [2020-11-30 00:43:57,429 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2020-11-30 00:43:57,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:43:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:43:57,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:43:57,444 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. cyclomatic complexity: 33 Second operand 6 states. [2020-11-30 00:43:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:43:57,557 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2020-11-30 00:43:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:43:57,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 151 transitions. [2020-11-30 00:43:57,560 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-30 00:43:57,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 143 transitions. [2020-11-30 00:43:57,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-30 00:43:57,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-11-30 00:43:57,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 143 transitions. [2020-11-30 00:43:57,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:43:57,568 INFO L691 BuchiCegarLoop]: Abstraction has 107 states and 143 transitions. [2020-11-30 00:43:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 143 transitions. [2020-11-30 00:43:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2020-11-30 00:43:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-30 00:43:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2020-11-30 00:43:57,575 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2020-11-30 00:43:57,575 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2020-11-30 00:43:57,575 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:43:57,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 99 transitions. [2020-11-30 00:43:57,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:43:57,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:57,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:57,577 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:43:57,578 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:43:57,578 INFO L794 eck$LassoCheckResult]: Stem: 1338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1312#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 1313#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1296#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1297#L65 assume !parse_expression_list_#t~switch7; 1356#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 1366#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1365#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1363#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1355#L65 assume parse_expression_list_#t~switch7; 1357#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 1364#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 1360#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9; 1361#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1368#L67 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 1319#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1315#L69-8 [2020-11-30 00:43:57,578 INFO L796 eck$LassoCheckResult]: Loop: 1315#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1330#L69-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 1327#L69-2 assume parse_expression_list_#t~short16; 1322#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1314#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 1315#L69-8 [2020-11-30 00:43:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash -893322464, now seen corresponding path program 1 times [2020-11-30 00:43:57,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:57,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686231984] [2020-11-30 00:43:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:57,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:57,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:57,626 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2020-11-30 00:43:57,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:57,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597163141] [2020-11-30 00:43:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:57,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:57,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:57,639 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1994277497, now seen corresponding path program 1 times [2020-11-30 00:43:57,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:57,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143460689] [2020-11-30 00:43:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:43:57,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143460689] [2020-11-30 00:43:57,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495907214] [2020-11-30 00:43:57,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:43:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:43:57,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 00:43:57,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:43:57,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:43:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:43:57,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:43:57,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-11-30 00:43:57,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038584448] [2020-11-30 00:43:57,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:43:57,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:43:57,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:43:57,943 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. cyclomatic complexity: 32 Second operand 7 states. [2020-11-30 00:43:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:43:58,122 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2020-11-30 00:43:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:43:58,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 217 transitions. [2020-11-30 00:43:58,125 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-30 00:43:58,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 146 states and 195 transitions. [2020-11-30 00:43:58,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-11-30 00:43:58,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-11-30 00:43:58,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 195 transitions. [2020-11-30 00:43:58,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:43:58,128 INFO L691 BuchiCegarLoop]: Abstraction has 146 states and 195 transitions. [2020-11-30 00:43:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 195 transitions. [2020-11-30 00:43:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2020-11-30 00:43:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-30 00:43:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2020-11-30 00:43:58,136 INFO L714 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2020-11-30 00:43:58,136 INFO L594 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2020-11-30 00:43:58,136 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:43:58,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 151 transitions. [2020-11-30 00:43:58,137 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-30 00:43:58,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:43:58,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:43:58,138 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:43:58,139 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:43:58,139 INFO L794 eck$LassoCheckResult]: Stem: 1656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1633#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 1634#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1612#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1613#L65 assume !parse_expression_list_#t~switch7; 1689#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 1688#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1687#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1686#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1684#L65 assume !parse_expression_list_#t~switch7; 1673#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 1682#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1679#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1677#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1672#L65 assume parse_expression_list_#t~switch7; 1674#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 1702#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 1699#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9; 1697#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1662#L67 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 1639#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1630#L69-8 [2020-11-30 00:43:58,139 INFO L796 eck$LassoCheckResult]: Loop: 1630#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1647#L69-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 1643#L69-2 assume parse_expression_list_#t~short16; 1635#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1629#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 1630#L69-8 [2020-11-30 00:43:58,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:58,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2142843030, now seen corresponding path program 2 times [2020-11-30 00:43:58,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:58,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527354559] [2020-11-30 00:43:58,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:58,192 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:58,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:58,230 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 4 times [2020-11-30 00:43:58,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:58,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857920889] [2020-11-30 00:43:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:58,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:58,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:58,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:43:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1461388995, now seen corresponding path program 2 times [2020-11-30 00:43:58,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:43:58,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630917246] [2020-11-30 00:43:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:43:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:58,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:43:58,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:43:58,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:43:59,660 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 197 DAG size of output: 139 [2020-11-30 00:43:59,872 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-30 00:43:59,874 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:43:59,874 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:43:59,875 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:43:59,875 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:43:59,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:43:59,875 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:43:59,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:43:59,875 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:43:59,875 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration8_Lasso [2020-11-30 00:43:59,875 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:43:59,875 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:43:59,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:59,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:59,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:59,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:43:59,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,344 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2020-11-30 00:44:00,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:00,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:01,188 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:01,188 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,200 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 [2020-11-30 00:44:01,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:44:01,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:44:01,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:44:01,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,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 [2020-11-30 00:44:01,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:44:01,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:44:01,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:44:01,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,265 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 [2020-11-30 00:44:01,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:44:01,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:44:01,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:44:01,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,297 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 [2020-11-30 00:44:01,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:01,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,336 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 [2020-11-30 00:44:01,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,338 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-11-30 00:44:01,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,342 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-11-30 00:44:01,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,394 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 [2020-11-30 00:44:01,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:01,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,436 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 [2020-11-30 00:44:01,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:01,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,470 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 [2020-11-30 00:44:01,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:01,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,505 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 [2020-11-30 00:44:01,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:01,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,547 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 [2020-11-30 00:44:01,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:01,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,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 [2020-11-30 00:44:01,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:01,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,625 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 [2020-11-30 00:44:01,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:01,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:01,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:01,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:01,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:01,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:01,684 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:44:01,738 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-11-30 00:44:01,738 INFO L444 ModelExtractionUtils]: 6 out of 28 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:01,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:44:01,749 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:44:01,749 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:44:01,749 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 [] [2020-11-30 00:44:01,935 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2020-11-30 00:44:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:01,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:01,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:02,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:44:02,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:02,041 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 [2020-11-30 00:44:02,041 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48 Second operand 4 states. [2020-11-30 00:44:02,218 INFO L75 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. [2020-11-30 00:44:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-30 00:44:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2020-11-30 00:44:02,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2020-11-30 00:44:02,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:02,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2020-11-30 00:44:02,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:02,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2020-11-30 00:44:02,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:02,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 360 transitions. [2020-11-30 00:44:02,224 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2020-11-30 00:44:02,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 170 states and 228 transitions. [2020-11-30 00:44:02,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-11-30 00:44:02,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-11-30 00:44:02,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 228 transitions. [2020-11-30 00:44:02,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:02,228 INFO L691 BuchiCegarLoop]: Abstraction has 170 states and 228 transitions. [2020-11-30 00:44:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 228 transitions. [2020-11-30 00:44:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2020-11-30 00:44:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-11-30 00:44:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2020-11-30 00:44:02,236 INFO L714 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2020-11-30 00:44:02,236 INFO L594 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2020-11-30 00:44:02,237 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:44:02,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 158 transitions. [2020-11-30 00:44:02,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-11-30 00:44:02,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:02,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:02,239 INFO L852 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] [2020-11-30 00:44:02,240 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:44:02,240 INFO L794 eck$LassoCheckResult]: Stem: 2269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 2242#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 2243#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2221#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2222#L65 assume parse_expression_list_#t~switch7; 2297#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2296#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 2295#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9; 2294#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2293#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 2292#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2291#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2290#L69-1 assume !parse_expression_list_#t~short17; 2289#L69-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14; 2288#L69-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 2287#L70 assume !parse_expression_list_#t~short20; 2286#L70-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19; 2285#L70-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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset; 2284#L41 parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.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; 2283#L14 assume !(0 == __VERIFIER_assert_~cond); 2282#L14-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); 2281#L71 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2280#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 2279#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2278#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2277#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2275#L65 assume parse_expression_list_#t~switch7; 2266#L66-5 [2020-11-30 00:44:02,240 INFO L796 eck$LassoCheckResult]: Loop: 2266#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2274#L66-1 assume parse_expression_list_#t~short10; 2265#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 2266#L66-5 [2020-11-30 00:44:02,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:02,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1563666499, now seen corresponding path program 1 times [2020-11-30 00:44:02,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:02,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992715816] [2020-11-30 00:44:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:02,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992715816] [2020-11-30 00:44:02,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:44:02,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:44:02,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53812479] [2020-11-30 00:44:02,339 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:44:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-11-30 00:44:02,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:02,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531538604] [2020-11-30 00:44:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:02,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:02,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:02,349 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:02,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:02,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:44:02,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:44:02,448 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. cyclomatic complexity: 49 Second operand 5 states. [2020-11-30 00:44:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:02,601 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2020-11-30 00:44:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:44:02,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 162 transitions. [2020-11-30 00:44:02,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:44:02,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 108 states and 147 transitions. [2020-11-30 00:44:02,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 00:44:02,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-30 00:44:02,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 147 transitions. [2020-11-30 00:44:02,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:02,606 INFO L691 BuchiCegarLoop]: Abstraction has 108 states and 147 transitions. [2020-11-30 00:44:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 147 transitions. [2020-11-30 00:44:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2020-11-30 00:44:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-11-30 00:44:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2020-11-30 00:44:02,612 INFO L714 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2020-11-30 00:44:02,612 INFO L594 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2020-11-30 00:44:02,612 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 00:44:02,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 119 transitions. [2020-11-30 00:44:02,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 00:44:02,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:02,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:02,614 INFO L852 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] [2020-11-30 00:44:02,614 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:44:02,615 INFO L794 eck$LassoCheckResult]: Stem: 2517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 2488#L-1 havoc main_#res;havoc main_#t~ret23, 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~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, 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); 2489#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2472#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2473#L65 assume !parse_expression_list_#t~switch7; 2494#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 2557#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2556#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2555#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2554#L65 assume parse_expression_list_#t~switch7; 2551#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2550#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 2548#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9; 2545#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2543#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 2542#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2512#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2508#L69-1 assume !parse_expression_list_#t~short17; 2509#L69-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem14; 2526#L69-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 2524#L70 assume !parse_expression_list_#t~short20; 2522#L70-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19; 2520#L70-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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.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~ret3.base, r_strncpy_#t~ret3.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset; 2513#L41 parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.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; 2506#L14 assume !(0 == __VERIFIER_assert_~cond); 2501#L14-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); 2481#L71 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2482#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 2528#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2527#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2525#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2523#L65 assume parse_expression_list_#t~switch7; 2484#L66-5 [2020-11-30 00:44:02,615 INFO L796 eck$LassoCheckResult]: Loop: 2484#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2485#L66-1 assume parse_expression_list_#t~short10; 2514#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 2484#L66-5 [2020-11-30 00:44:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:02,615 INFO L82 PathProgramCache]: Analyzing trace with hash -168608633, now seen corresponding path program 1 times [2020-11-30 00:44:02,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:02,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883697634] [2020-11-30 00:44:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:02,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883697634] [2020-11-30 00:44:02,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51760691] [2020-11-30 00:44:02,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bf4cf6f-aa99-4095-b110-3367439d19d4/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:02,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:44:02,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:02,934 INFO L384 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 [2020-11-30 00:44:02,938 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:44:02,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:44:02,941 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:44:02,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-11-30 00:44:03,002 INFO L384 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 [2020-11-30 00:44:03,003 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:44:03,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:44:03,021 INFO L545 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. [2020-11-30 00:44:03,021 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2020-11-30 00:44:03,122 INFO L384 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 [2020-11-30 00:44:03,124 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:44:03,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:44:03,130 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:44:03,131 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2020-11-30 00:44:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:03,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:03,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-30 00:44:03,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219652320] [2020-11-30 00:44:03,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:44:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-11-30 00:44:03,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:03,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321390022] [2020-11-30 00:44:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:03,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:03,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:03,148 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:03,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:44:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:44:03,230 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. cyclomatic complexity: 38 Second operand 9 states. [2020-11-30 00:44:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:03,463 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2020-11-30 00:44:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:44:03,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 82 transitions. [2020-11-30 00:44:03,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 00:44:03,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2020-11-30 00:44:03,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-30 00:44:03,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-30 00:44:03,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-30 00:44:03,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:44:03,465 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:44:03,465 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:44:03,465 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:44:03,465 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-30 00:44:03,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:44:03,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 00:44:03,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-30 00:44:03,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 12:44:03 BoogieIcfgContainer [2020-11-30 00:44:03,471 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 00:44:03,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:44:03,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:44:03,472 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:44:03,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:43:48" (3/4) ... [2020-11-30 00:44:03,477 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 00:44:03,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:44:03,478 INFO L168 Benchmark]: Toolchain (without parser) took 16766.26 ms. Allocated memory was 111.1 MB in the beginning and 243.3 MB in the end (delta: 132.1 MB). Free memory was 75.7 MB in the beginning and 193.6 MB in the end (delta: -117.9 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:44:03,478 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 111.1 MB. Free memory was 84.6 MB in the beginning and 84.6 MB in the end (delta: 26.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:44:03,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.07 ms. Allocated memory is still 111.1 MB. Free memory was 75.4 MB in the beginning and 85.9 MB in the end (delta: -10.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:44:03,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.81 ms. Allocated memory is still 111.1 MB. Free memory was 85.9 MB in the beginning and 83.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:44:03,480 INFO L168 Benchmark]: Boogie Preprocessor took 33.86 ms. Allocated memory is still 111.1 MB. Free memory was 83.8 MB in the beginning and 82.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:44:03,480 INFO L168 Benchmark]: RCFGBuilder took 863.73 ms. Allocated memory is still 111.1 MB. Free memory was 82.6 MB in the beginning and 61.9 MB in the end (delta: 20.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:44:03,481 INFO L168 Benchmark]: BuchiAutomizer took 15421.55 ms. Allocated memory was 111.1 MB in the beginning and 243.3 MB in the end (delta: 132.1 MB). Free memory was 61.6 MB in the beginning and 193.6 MB in the end (delta: -132.0 MB). Peak memory consumption was 4.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:44:03,481 INFO L168 Benchmark]: Witness Printer took 5.01 ms. Allocated memory is still 243.3 MB. Free memory is still 193.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:44:03,484 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 111.1 MB. Free memory was 84.6 MB in the beginning and 84.6 MB in the end (delta: 26.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 379.07 ms. Allocated memory is still 111.1 MB. Free memory was 75.4 MB in the beginning and 85.9 MB in the end (delta: -10.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.81 ms. Allocated memory is still 111.1 MB. Free memory was 85.9 MB in the beginning and 83.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.86 ms. Allocated memory is still 111.1 MB. Free memory was 83.8 MB in the beginning and 82.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 863.73 ms. Allocated memory is still 111.1 MB. Free memory was 82.6 MB in the beginning and 61.9 MB in the end (delta: 20.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 15421.55 ms. Allocated memory was 111.1 MB in the beginning and 243.3 MB in the end (delta: 132.1 MB). Free memory was 61.6 MB in the beginning and 193.6 MB in the end (delta: -132.0 MB). Peak memory consumption was 4.3 MB. Max. memory is 16.1 GB. * Witness Printer took 5.01 ms. Allocated memory is still 243.3 MB. Free memory is still 193.6 MB. There was no memory consumed. Max. memory is 16.1 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 -1 * str + unknown-#length-unknown[str] + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * start and consists of 5 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 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.3s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 13.0s. Construction of modules took 0.8s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 237 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: 319 SDtfs, 533 SDslu, 625 SDs, 0 SdLazy, 540 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf100 lsp91 ukn63 mio100 lsp42 div100 bol100 ite100 ukn100 eq192 hnf86 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 2 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...