./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49da897df5dcdfc1bc615bb8c40422792fce477f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:30:27,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:30:27,339 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:30:27,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:30:27,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:30:27,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:30:27,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:30:27,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:30:27,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:30:27,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:30:27,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:30:27,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:30:27,357 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:30:27,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:30:27,359 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:30:27,360 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:30:27,360 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:30:27,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:30:27,364 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:30:27,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:30:27,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:30:27,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:30:27,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:30:27,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:30:27,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:30:27,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:30:27,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:30:27,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:30:27,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:30:27,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:30:27,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:30:27,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:30:27,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:30:27,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:30:27,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:30:27,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:30:27,378 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 07:30:27,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:30:27,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:30:27,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:30:27,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:30:27,394 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:30:27,395 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:30:27,395 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:30:27,395 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:30:27,395 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:30:27,395 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:30:27,395 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:30:27,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:30:27,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:30:27,396 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:30:27,396 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:30:27,396 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:30:27,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:30:27,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:30:27,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:30:27,397 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:30:27,397 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:30:27,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:30:27,399 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:30:27,400 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:30:27,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:30:27,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:30:27,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:30:27,400 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:30:27,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:30:27,401 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:30:27,401 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:30:27,402 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:30:27,402 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49da897df5dcdfc1bc615bb8c40422792fce477f [2018-11-23 07:30:27,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:30:27,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:30:27,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:30:27,450 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:30:27,450 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:30:27,451 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-23 07:30:27,501 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/data/9b2a5419c/f9c180a6c3b747d98fa8b6005776f3fd/FLAG07ad52dce [2018-11-23 07:30:27,865 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:30:27,865 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-23 07:30:27,872 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/data/9b2a5419c/f9c180a6c3b747d98fa8b6005776f3fd/FLAG07ad52dce [2018-11-23 07:30:27,883 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/data/9b2a5419c/f9c180a6c3b747d98fa8b6005776f3fd [2018-11-23 07:30:27,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:30:27,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:30:27,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:30:27,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:30:27,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:30:27,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:27" (1/1) ... [2018-11-23 07:30:27,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da339c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:27, skipping insertion in model container [2018-11-23 07:30:27,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:30:27" (1/1) ... [2018-11-23 07:30:27,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:30:27,920 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:30:28,070 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:30:28,079 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:30:28,103 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:30:28,118 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:30:28,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28 WrapperNode [2018-11-23 07:30:28,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:30:28,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:30:28,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:30:28,120 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:30:28,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:30:28,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:30:28,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:30:28,196 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:30:28,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... [2018-11-23 07:30:28,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:30:28,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:30:28,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:30:28,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:30:28,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:30:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-23 07:30:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:30:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:30:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:30:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:30:28,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:30:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:30:28,485 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:30:28,485 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 07:30:28,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:28 BoogieIcfgContainer [2018-11-23 07:30:28,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:30:28,486 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:30:28,486 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:30:28,491 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:30:28,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:30:28,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:30:27" (1/3) ... [2018-11-23 07:30:28,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a35ef37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:30:28, skipping insertion in model container [2018-11-23 07:30:28,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:30:28,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:30:28" (2/3) ... [2018-11-23 07:30:28,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a35ef37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:30:28, skipping insertion in model container [2018-11-23 07:30:28,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:30:28,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:28" (3/3) ... [2018-11-23 07:30:28,498 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-23 07:30:28,539 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:30:28,539 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:30:28,540 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:30:28,540 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:30:28,540 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:30:28,540 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:30:28,540 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:30:28,540 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:30:28,540 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:30:28,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-23 07:30:28,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:30:28,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:28,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:28,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:30:28,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:30:28,577 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:30:28,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-23 07:30:28,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-23 07:30:28,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:28,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:28,580 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:30:28,580 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:30:28,587 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 8#L51true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 20#L52-4true [2018-11-23 07:30:28,588 INFO L796 eck$LassoCheckResult]: Loop: 20#L52-4true parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 28#L55true assume !parse_expression_list_#t~switch3; 12#L54true havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 25#L52-1true call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 22#L52-2true assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 20#L52-4true [2018-11-23 07:30:28,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 07:30:28,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:28,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:28,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:28,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:28,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:28,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash 41837553, now seen corresponding path program 1 times [2018-11-23 07:30:28,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:28,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:28,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash 181165358, now seen corresponding path program 1 times [2018-11-23 07:30:28,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:28,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:28,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:28,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:28,958 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-11-23 07:30:29,027 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:30:29,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:30:29,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:30:29,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:30:29,029 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:30:29,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:30:29,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:30:29,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:30:29,030 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 07:30:29,030 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:30:29,030 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:30:29,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:29,481 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:30:29,484 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:30:29,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:29,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:29,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:29,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:29,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:29,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:29,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:29,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:29,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:29,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:29,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:29,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:29,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:29,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:29,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:29,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:29,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:29,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:29,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:29,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:29,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:29,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:29,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:29,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:29,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:29,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:29,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:29,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:29,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:29,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:29,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:29,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:29,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,556 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:30:29,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,557 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:30:29,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:29,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:29,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:29,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:29,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:29,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:29,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:29,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:29,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:29,596 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:30:29,628 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 07:30:29,628 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 07:30:29,631 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:30:29,632 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:30:29,632 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:30:29,633 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2018-11-23 07:30:29,672 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 07:30:29,676 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:30:29,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:29,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:30:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:29,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:30:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:29,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:30:29,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 3 states. [2018-11-23 07:30:29,806 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states.. Second operand 3 states. Result 96 states and 135 transitions. Complement of second has 5 states. [2018-11-23 07:30:29,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:30:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:30:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 07:30:29,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-23 07:30:29,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:29,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-23 07:30:29,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:29,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-23 07:30:29,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:29,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 135 transitions. [2018-11-23 07:30:29,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:29,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 39 states and 54 transitions. [2018-11-23 07:30:29,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 07:30:29,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 07:30:29,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 54 transitions. [2018-11-23 07:30:29,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:29,823 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-11-23 07:30:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 54 transitions. [2018-11-23 07:30:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 07:30:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 07:30:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2018-11-23 07:30:29,845 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-11-23 07:30:29,845 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-11-23 07:30:29,845 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:30:29,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2018-11-23 07:30:29,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:29,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:29,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:29,846 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 07:30:29,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:30:29,847 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 208#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 209#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 226#L55 assume parse_expression_list_#t~switch3; 213#L56-5 [2018-11-23 07:30:29,847 INFO L796 eck$LassoCheckResult]: Loop: 213#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 219#L56-1 assume parse_expression_list_#t~short6; 211#L56-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 213#L56-5 [2018-11-23 07:30:29,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2018-11-23 07:30:29,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:29,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:29,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:29,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2018-11-23 07:30:29,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:29,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:29,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:29,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:29,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2018-11-23 07:30:29,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:29,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:29,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:29,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:29,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:30,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:30:30,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:30:30,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:30:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:30:30,078 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-23 07:30:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:30:30,172 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2018-11-23 07:30:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:30:30,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 95 transitions. [2018-11-23 07:30:30,174 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 07:30:30,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 95 transitions. [2018-11-23 07:30:30,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 07:30:30,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 07:30:30,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 95 transitions. [2018-11-23 07:30:30,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:30,176 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-11-23 07:30:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 95 transitions. [2018-11-23 07:30:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 45. [2018-11-23 07:30:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 07:30:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-11-23 07:30:30,179 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-11-23 07:30:30,179 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-11-23 07:30:30,179 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:30:30,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2018-11-23 07:30:30,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:30,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:30,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:30,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:30,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:30:30,181 INFO L794 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 330#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 328#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 329#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 344#L55 assume !parse_expression_list_#t~switch3; 335#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 336#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 347#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 345#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 346#L55 assume parse_expression_list_#t~switch3; 351#L56-5 [2018-11-23 07:30:30,181 INFO L796 eck$LassoCheckResult]: Loop: 351#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 352#L56-1 assume parse_expression_list_#t~short6; 364#L56-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 351#L56-5 [2018-11-23 07:30:30,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:30,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1993749743, now seen corresponding path program 1 times [2018-11-23 07:30:30,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:30,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2018-11-23 07:30:30,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:30,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:30,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash -695838358, now seen corresponding path program 1 times [2018-11-23 07:30:30,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:30,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:30,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:30,483 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-11-23 07:30:30,526 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:30:30,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:30:30,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:30:30,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:30:30,527 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:30:30,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:30:30,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:30:30,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:30:30,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-23 07:30:30,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:30:30,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:30:30,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:30,915 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:30:30,915 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:30:30,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:30,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:30,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:30,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:30,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:30,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:30,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:30,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:30,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:30,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:30,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:30,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:30,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:30,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,976 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:30:30,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,978 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:30:30,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:30,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,985 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:30:30,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,986 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:30:30,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:30,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:30,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:30,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:30,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:30,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:30,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:30,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:30,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:30,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:30,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:31,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:31,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:31,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:31,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:31,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:31,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:31,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:31,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:31,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:31,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:31,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:31,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:31,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:31,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:31,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:31,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:31,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:31,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:31,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:31,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:31,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:31,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:31,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:31,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:31,021 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:30:31,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:30:31,035 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 07:30:31,035 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:30:31,036 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:30:31,036 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:30:31,036 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2) = -1*ULTIMATE.start_parse_expression_list_~start~0 - 1*ULTIMATE.start_parse_expression_list_~str.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 Supporting invariants [] [2018-11-23 07:30:31,068 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 07:30:31,069 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:30:31,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:31,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:30:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:31,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:30:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:31,121 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:30:31,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-23 07:30:31,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 148 states and 208 transitions. Complement of second has 7 states. [2018-11-23 07:30:31,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:30:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:30:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 07:30:31,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 07:30:31,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:31,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-23 07:30:31,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:31,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 07:30:31,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:31,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 208 transitions. [2018-11-23 07:30:31,202 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-23 07:30:31,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 112 states and 156 transitions. [2018-11-23 07:30:31,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-23 07:30:31,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-23 07:30:31,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 156 transitions. [2018-11-23 07:30:31,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:31,204 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 156 transitions. [2018-11-23 07:30:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 156 transitions. [2018-11-23 07:30:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 71. [2018-11-23 07:30:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 07:30:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2018-11-23 07:30:31,209 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2018-11-23 07:30:31,209 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2018-11-23 07:30:31,209 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:30:31,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 101 transitions. [2018-11-23 07:30:31,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:31,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:31,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:31,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:31,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:30:31,211 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 622#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 620#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 621#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 637#L55 assume parse_expression_list_#t~switch3; 672#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 629#L56-1 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 623#L56-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 624#L56-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 641#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 657#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 616#L59-8 [2018-11-23 07:30:31,212 INFO L796 eck$LassoCheckResult]: Loop: 616#L59-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 617#L59-1 assume !parse_expression_list_#t~short13; 634#L59-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 616#L59-8 [2018-11-23 07:30:31,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2018-11-23 07:30:31,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2018-11-23 07:30:31,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:31,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:31,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:30:31,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:30:31,250 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:30:31,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:30:31,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:30:31,251 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-23 07:30:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:30:31,260 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2018-11-23 07:30:31,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:30:31,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 102 transitions. [2018-11-23 07:30:31,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:31,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 101 transitions. [2018-11-23 07:30:31,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 07:30:31,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 07:30:31,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 101 transitions. [2018-11-23 07:30:31,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:31,264 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2018-11-23 07:30:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 101 transitions. [2018-11-23 07:30:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 07:30:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 07:30:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2018-11-23 07:30:31,268 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2018-11-23 07:30:31,268 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2018-11-23 07:30:31,268 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:30:31,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2018-11-23 07:30:31,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:31,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:31,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:31,269 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:31,269 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:30:31,269 INFO L794 eck$LassoCheckResult]: Stem: 800#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 772#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 766#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 767#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 786#L55 assume parse_expression_list_#t~switch3; 794#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 779#L56-1 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 773#L56-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 774#L56-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 790#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 802#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 768#L59-8 [2018-11-23 07:30:31,269 INFO L796 eck$LassoCheckResult]: Loop: 768#L59-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 769#L59-1 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 783#L59-2 assume parse_expression_list_#t~short12; 804#L59-4 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 799#L59-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 768#L59-8 [2018-11-23 07:30:31,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 2 times [2018-11-23 07:30:31,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:31,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2018-11-23 07:30:31,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:31,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,293 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2018-11-23 07:30:31,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:31,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:30:31,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:30:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:30:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:30:31,388 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. cyclomatic complexity: 35 Second operand 6 states. [2018-11-23 07:30:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:30:31,452 INFO L93 Difference]: Finished difference Result 121 states and 159 transitions. [2018-11-23 07:30:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:30:31,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 159 transitions. [2018-11-23 07:30:31,454 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 07:30:31,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 109 states and 146 transitions. [2018-11-23 07:30:31,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 07:30:31,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 07:30:31,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 146 transitions. [2018-11-23 07:30:31,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:31,456 INFO L705 BuchiCegarLoop]: Abstraction has 109 states and 146 transitions. [2018-11-23 07:30:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 146 transitions. [2018-11-23 07:30:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 76. [2018-11-23 07:30:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 07:30:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2018-11-23 07:30:31,462 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 103 transitions. [2018-11-23 07:30:31,462 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 103 transitions. [2018-11-23 07:30:31,462 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:30:31,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 103 transitions. [2018-11-23 07:30:31,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:31,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:31,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:31,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:31,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:30:31,464 INFO L794 eck$LassoCheckResult]: Stem: 1007#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 982#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 976#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 977#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 996#L55 assume !parse_expression_list_#t~switch3; 1029#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1045#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1044#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1042#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1039#L55 assume parse_expression_list_#t~switch3; 1040#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 992#L56-1 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 985#L56-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 986#L56-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1046#L57 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 1009#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 978#L59-8 [2018-11-23 07:30:31,464 INFO L796 eck$LassoCheckResult]: Loop: 978#L59-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 979#L59-1 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 994#L59-2 assume parse_expression_list_#t~short12; 1011#L59-4 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 1006#L59-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 978#L59-8 [2018-11-23 07:30:31,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2088435936, now seen corresponding path program 1 times [2018-11-23 07:30:31,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2018-11-23 07:30:31,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1723738951, now seen corresponding path program 1 times [2018-11-23 07:30:31,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:31,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:30:31,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:30:31,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:31,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:30:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:31,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:30:31,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 07:30:31,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:30:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:30:31,643 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. cyclomatic complexity: 33 Second operand 7 states. [2018-11-23 07:30:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:30:31,727 INFO L93 Difference]: Finished difference Result 162 states and 219 transitions. [2018-11-23 07:30:31,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:30:31,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 219 transitions. [2018-11-23 07:30:31,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 07:30:31,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 147 states and 197 transitions. [2018-11-23 07:30:31,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 07:30:31,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 07:30:31,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 197 transitions. [2018-11-23 07:30:31,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:31,733 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 197 transitions. [2018-11-23 07:30:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 197 transitions. [2018-11-23 07:30:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 114. [2018-11-23 07:30:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 07:30:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2018-11-23 07:30:31,741 INFO L728 BuchiCegarLoop]: Abstraction has 114 states and 154 transitions. [2018-11-23 07:30:31,741 INFO L608 BuchiCegarLoop]: Abstraction has 114 states and 154 transitions. [2018-11-23 07:30:31,741 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 07:30:31,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 154 transitions. [2018-11-23 07:30:31,742 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 07:30:31,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:31,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:31,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:31,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:30:31,743 INFO L794 eck$LassoCheckResult]: Stem: 1328#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1302#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1296#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1297#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1317#L55 assume !parse_expression_list_#t~switch3; 1388#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1393#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1392#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1390#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1389#L55 assume !parse_expression_list_#t~switch3; 1350#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1395#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1394#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1354#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1349#L55 assume parse_expression_list_#t~switch3; 1351#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1402#L56-1 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 1400#L56-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 1399#L56-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1396#L57 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 1329#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1298#L59-8 [2018-11-23 07:30:31,743 INFO L796 eck$LassoCheckResult]: Loop: 1298#L59-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1299#L59-1 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 1314#L59-2 assume parse_expression_list_#t~short12; 1332#L59-4 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 1327#L59-6 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 1298#L59-8 [2018-11-23 07:30:31,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1406584982, now seen corresponding path program 2 times [2018-11-23 07:30:31,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:31,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2018-11-23 07:30:31,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash -306417981, now seen corresponding path program 2 times [2018-11-23 07:30:31,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:31,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:32,190 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 113 [2018-11-23 07:30:32,244 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:30:32,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:30:32,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:30:32,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:30:32,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:30:32,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:30:32,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:30:32,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:30:32,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 07:30:32,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:30:32,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:30:32,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:30:32,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:30:32,683 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:30:32,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:32,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:32,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:32,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:32,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:32,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:32,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:32,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:32,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:32,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:32,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:32,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:30:32,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:32,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:32,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:32,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:30:32,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:30:32,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:32,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:32,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:32,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:32,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:32,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:32,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:32,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:32,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:32,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:32,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:32,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:32,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:32,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:32,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:32,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:32,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:30:32,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:30:32,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:30:32,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:30:32,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:30:32,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:30:32,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:30:32,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:30:32,715 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:30:32,724 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 07:30:32,724 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 07:30:32,724 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:30:32,725 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:30:32,725 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:30:32,726 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2018-11-23 07:30:32,774 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-11-23 07:30:32,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:32,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:30:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:32,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:30:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:32,838 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 07:30:32,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 154 transitions. cyclomatic complexity: 49 Second operand 4 states. [2018-11-23 07:30:32,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 154 transitions. cyclomatic complexity: 49. Second operand 4 states. Result 264 states and 358 transitions. Complement of second has 11 states. [2018-11-23 07:30:32,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 07:30:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:30:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 07:30:32,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 74 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-23 07:30:32,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:32,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 74 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-23 07:30:32,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:32,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 74 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-23 07:30:32,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:30:32,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 358 transitions. [2018-11-23 07:30:32,925 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2018-11-23 07:30:32,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 170 states and 229 transitions. [2018-11-23 07:30:32,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 07:30:32,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 07:30:32,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 229 transitions. [2018-11-23 07:30:32,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:32,927 INFO L705 BuchiCegarLoop]: Abstraction has 170 states and 229 transitions. [2018-11-23 07:30:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 229 transitions. [2018-11-23 07:30:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-11-23 07:30:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 07:30:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2018-11-23 07:30:32,932 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 161 transitions. [2018-11-23 07:30:32,932 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 161 transitions. [2018-11-23 07:30:32,932 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 07:30:32,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 161 transitions. [2018-11-23 07:30:32,933 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 07:30:32,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:32,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:32,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:32,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:30:32,938 INFO L794 eck$LassoCheckResult]: Stem: 1864#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1839#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1833#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1834#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1852#L55 assume parse_expression_list_#t~switch3; 1920#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1918#L56-1 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 1916#L56-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 1914#L56-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1912#L57 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 1911#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1910#L59-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1909#L59-1 assume !parse_expression_list_#t~short13; 1908#L59-6 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 1907#L59-9 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 1906#L60 assume !parse_expression_list_#t~short16; 1905#L60-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 1904#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;__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; 1903#L4 assume !(0 == __VERIFIER_assert_~cond); 1902#L4-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); 1901#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 1900#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1899#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1898#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1897#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1896#L55 assume parse_expression_list_#t~switch3; 1841#L56-5 [2018-11-23 07:30:32,938 INFO L796 eck$LassoCheckResult]: Loop: 1841#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1847#L56-1 assume parse_expression_list_#t~short6; 1840#L56-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 1841#L56-5 [2018-11-23 07:30:32,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash 761084980, now seen corresponding path program 1 times [2018-11-23 07:30:32,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:32,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:32,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:30:32,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:30:32,984 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:30:32,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:32,985 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2018-11-23 07:30:32,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:32,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:32,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:32,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:30:33,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:30:33,034 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. cyclomatic complexity: 50 Second operand 7 states. [2018-11-23 07:30:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:30:33,178 INFO L93 Difference]: Finished difference Result 208 states and 279 transitions. [2018-11-23 07:30:33,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:30:33,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 279 transitions. [2018-11-23 07:30:33,181 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2018-11-23 07:30:33,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 172 states and 227 transitions. [2018-11-23 07:30:33,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-23 07:30:33,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-23 07:30:33,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 227 transitions. [2018-11-23 07:30:33,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:33,182 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 227 transitions. [2018-11-23 07:30:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 227 transitions. [2018-11-23 07:30:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 122. [2018-11-23 07:30:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 07:30:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2018-11-23 07:30:33,187 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2018-11-23 07:30:33,187 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2018-11-23 07:30:33,187 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 07:30:33,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2018-11-23 07:30:33,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 07:30:33,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:33,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:33,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:33,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:30:33,189 INFO L794 eck$LassoCheckResult]: Stem: 2215#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2187#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2185#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2186#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2199#L55 assume parse_expression_list_#t~switch3; 2256#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2255#L56-1 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2254#L56-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 2253#L56-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2252#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2251#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2250#L59-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2249#L59-1 assume !parse_expression_list_#t~short13; 2248#L59-6 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 2247#L59-9 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 2246#L60 assume !parse_expression_list_#t~short16; 2245#L60-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 2244#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;__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; 2243#L4 assume !(0 == __VERIFIER_assert_~cond); 2242#L4-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); 2241#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2240#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2239#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2238#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2237#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2235#L55 assume parse_expression_list_#t~switch3; 2189#L56-5 [2018-11-23 07:30:33,189 INFO L796 eck$LassoCheckResult]: Loop: 2189#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2194#L56-1 assume parse_expression_list_#t~short6; 2188#L56-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 2189#L56-5 [2018-11-23 07:30:33,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash -827262922, now seen corresponding path program 1 times [2018-11-23 07:30:33,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:30:33,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:30:33,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:30:33,234 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:30:33,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:33,234 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2018-11-23 07:30:33,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:33,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:33,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:30:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:30:33,271 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. cyclomatic complexity: 48 Second operand 6 states. [2018-11-23 07:30:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:30:33,347 INFO L93 Difference]: Finished difference Result 110 states and 146 transitions. [2018-11-23 07:30:33,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:30:33,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 146 transitions. [2018-11-23 07:30:33,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:33,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 97 states and 131 transitions. [2018-11-23 07:30:33,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 07:30:33,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 07:30:33,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 131 transitions. [2018-11-23 07:30:33,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:33,350 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 131 transitions. [2018-11-23 07:30:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 131 transitions. [2018-11-23 07:30:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-23 07:30:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 07:30:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2018-11-23 07:30:33,353 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 131 transitions. [2018-11-23 07:30:33,353 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 131 transitions. [2018-11-23 07:30:33,353 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 07:30:33,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 131 transitions. [2018-11-23 07:30:33,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:33,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:33,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:33,359 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:33,359 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:30:33,359 INFO L794 eck$LassoCheckResult]: Stem: 2459#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2433#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2427#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2428#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2447#L55 assume !parse_expression_list_#t~switch3; 2460#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2519#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2518#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2448#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2449#L55 assume parse_expression_list_#t~switch3; 2501#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2505#L56-1 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2500#L56-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 2498#L56-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2494#L57 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 2490#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2487#L59-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2478#L59-1 assume !parse_expression_list_#t~short13; 2474#L59-6 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 2473#L59-9 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 2472#L60 assume !parse_expression_list_#t~short16; 2471#L60-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 2424#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;__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; 2443#L4 assume !(0 == __VERIFIER_assert_~cond); 2465#L4-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); 2454#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2455#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2517#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2516#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2515#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2514#L55 assume parse_expression_list_#t~switch3; 2436#L56-5 [2018-11-23 07:30:33,359 INFO L796 eck$LassoCheckResult]: Loop: 2436#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2441#L56-1 assume parse_expression_list_#t~short6; 2434#L56-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 2436#L56-5 [2018-11-23 07:30:33,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1887656042, now seen corresponding path program 1 times [2018-11-23 07:30:33,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:33,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:30:33,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:30:33,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 07:30:33,413 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:30:33,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:33,413 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2018-11-23 07:30:33,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:33,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:33,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:30:33,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:30:33,450 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. cyclomatic complexity: 41 Second operand 8 states. [2018-11-23 07:30:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:30:33,579 INFO L93 Difference]: Finished difference Result 168 states and 230 transitions. [2018-11-23 07:30:33,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:30:33,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 230 transitions. [2018-11-23 07:30:33,582 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 07:30:33,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 147 states and 199 transitions. [2018-11-23 07:30:33,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 07:30:33,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 07:30:33,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 199 transitions. [2018-11-23 07:30:33,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:30:33,583 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 199 transitions. [2018-11-23 07:30:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 199 transitions. [2018-11-23 07:30:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 116. [2018-11-23 07:30:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 07:30:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2018-11-23 07:30:33,590 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 157 transitions. [2018-11-23 07:30:33,590 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 157 transitions. [2018-11-23 07:30:33,590 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 07:30:33,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 157 transitions. [2018-11-23 07:30:33,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 07:30:33,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:30:33,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:30:33,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:30:33,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:30:33,592 INFO L794 eck$LassoCheckResult]: Stem: 2750#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2722#L-1 havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2720#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2721#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2736#L55 assume !parse_expression_list_#t~switch3; 2756#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2745#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2746#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2803#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2801#L55 assume parse_expression_list_#t~switch3; 2800#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2799#L56-1 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2797#L56-3 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 2794#L56-6 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2793#L57 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2752#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2718#L59-8 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2719#L59-1 assume !parse_expression_list_#t~short13; 2735#L59-6 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11; 2769#L59-9 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 2767#L60 assume !parse_expression_list_#t~short16; 2765#L60-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 2712#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;__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; 2733#L4 assume !(0 == __VERIFIER_assert_~cond); 2757#L4-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); 2742#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2743#L54 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2770#L52-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2768#L52-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2766#L52-4 parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2762#L55 assume parse_expression_list_#t~switch3; 2725#L56-5 [2018-11-23 07:30:33,593 INFO L796 eck$LassoCheckResult]: Loop: 2725#L56-5 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2731#L56-1 assume parse_expression_list_#t~short6; 2723#L56-3 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 2725#L56-5 [2018-11-23 07:30:33,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash 299308140, now seen corresponding path program 1 times [2018-11-23 07:30:33,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:33,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:33,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:30:33,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:30:33,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:30:33,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84a1506c-0075-444e-af8d-6fb43cc78a63/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:30:33,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:30:33,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:30:33,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 07:30:33,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 07:30:33,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:30:33,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-23 07:30:33,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 07:30:33,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 07:30:33,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:30:33,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:30:33,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 07:30:33,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2018-11-23 07:30:33,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-23 07:30:33,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 07:30:33,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:30:33,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 07:30:33,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:30:33,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:30:33,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:30:33,927 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2018-11-23 07:30:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:30:33,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:30:33,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-23 07:30:33,951 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:30:33,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:30:33,952 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2018-11-23 07:30:33,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:30:33,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:30:33,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:30:33,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:30:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:30:33,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 07:30:33,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:30:33,991 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. cyclomatic complexity: 48 Second operand 16 states. [2018-11-23 07:30:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:30:46,296 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-11-23 07:30:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 07:30:46,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 97 transitions. [2018-11-23 07:30:46,297 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:30:46,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2018-11-23 07:30:46,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 07:30:46,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 07:30:46,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 07:30:46,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:30:46,297 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:30:46,297 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:30:46,298 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:30:46,298 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 07:30:46,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:30:46,298 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:30:46,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 07:30:46,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:30:46 BoogieIcfgContainer [2018-11-23 07:30:46,303 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:30:46,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:30:46,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:30:46,303 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:30:46,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:30:28" (3/4) ... [2018-11-23 07:30:46,306 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:30:46,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:30:46,307 INFO L168 Benchmark]: Toolchain (without parser) took 18420.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 958.1 MB in the beginning and 932.3 MB in the end (delta: 25.8 MB). Peak memory consumption was 371.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:30:46,308 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:30:46,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.88 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:30:46,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:30:46,309 INFO L168 Benchmark]: Boogie Preprocessor took 19.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:30:46,309 INFO L168 Benchmark]: RCFGBuilder took 269.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:30:46,310 INFO L168 Benchmark]: BuchiAutomizer took 17816.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 932.3 MB in the end (delta: 188.9 MB). Peak memory consumption was 377.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:30:46,310 INFO L168 Benchmark]: Witness Printer took 3.27 ms. Allocated memory is still 1.4 GB. Free memory is still 932.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:30:46,312 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 230.88 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 269.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17816.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 932.3 MB in the end (delta: 188.9 MB). Peak memory consumption was 377.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.27 ms. Allocated memory is still 1.4 GB. Free memory is still 932.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (8 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * start + -1 * str + unknown-#length-unknown[str] and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.7s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 4.2s. Construction of modules took 12.5s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 263 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 122 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 341 SDtfs, 833 SDslu, 779 SDs, 0 SdLazy, 766 SolverSat, 140 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital147 mio100 ax100 hnf101 lsp89 ukn73 mio100 lsp44 div100 bol100 ite100 ukn100 eq187 hnf86 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...