./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/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 10cc4caffca660fca2e6a4a0cd5f7ba7ba4e10af ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:47:49,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:47:49,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:47:49,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:47:49,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:47:49,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:47:49,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:47:49,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:47:49,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:47:49,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:47:49,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:47:49,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:47:49,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:47:49,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:47:49,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:47:49,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:47:49,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:47:49,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:47:49,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:47:49,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:47:49,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:47:49,516 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:47:49,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:47:49,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:47:49,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:47:49,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:47:49,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:47:49,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:47:49,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:47:49,521 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:47:49,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:47:49,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:47:49,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:47:49,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:47:49,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:47:49,523 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:47:49,523 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:47:49,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:47:49,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:47:49,535 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:47:49,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:47:49,535 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:47:49,535 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:47:49,535 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:47:49,536 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:47:49,536 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:47:49,536 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:47:49,536 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:47:49,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:47:49,536 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:47:49,536 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:47:49,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:47:49,537 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:47:49,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:47:49,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:47:49,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:47:49,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:47:49,537 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:47:49,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:47:49,538 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:47:49,538 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:47:49,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:47:49,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:47:49,538 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:47:49,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:47:49,538 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:47:49,538 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:47:49,539 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:47:49,539 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_36984004-102b-4fce-9c78-7555841ed741/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 -> 10cc4caffca660fca2e6a4a0cd5f7ba7ba4e10af [2018-11-10 04:47:49,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:47:49,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:47:49,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:47:49,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:47:49,574 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:47:49,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/../../sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-10 04:47:49,619 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/data/77f9805b3/d631298232384bd080623f03385223c1/FLAGfced51082 [2018-11-10 04:47:50,024 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:47:50,025 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-10 04:47:50,029 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/data/77f9805b3/d631298232384bd080623f03385223c1/FLAGfced51082 [2018-11-10 04:47:50,038 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/data/77f9805b3/d631298232384bd080623f03385223c1 [2018-11-10 04:47:50,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:47:50,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:47:50,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:47:50,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:47:50,043 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:47:50,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab05a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50, skipping insertion in model container [2018-11-10 04:47:50,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:47:50,066 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:47:50,182 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:47:50,188 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:47:50,205 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:47:50,215 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:47:50,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50 WrapperNode [2018-11-10 04:47:50,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:47:50,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:47:50,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:47:50,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:47:50,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:47:50,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:47:50,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:47:50,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:47:50,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... [2018-11-10 04:47:50,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:47:50,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:47:50,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:47:50,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:47:50,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/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-10 04:47:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:47:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:47:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:47:50,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:47:50,544 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:47:50,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:47:50 BoogieIcfgContainer [2018-11-10 04:47:50,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:47:50,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:47:50,545 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:47:50,547 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:47:50,548 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:47:50,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:47:50" (1/3) ... [2018-11-10 04:47:50,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b0ad41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:47:50, skipping insertion in model container [2018-11-10 04:47:50,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:47:50,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:47:50" (2/3) ... [2018-11-10 04:47:50,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b0ad41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:47:50, skipping insertion in model container [2018-11-10 04:47:50,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:47:50,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:47:50" (3/3) ... [2018-11-10 04:47:50,550 INFO L375 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-10 04:47:50,587 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:47:50,588 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:47:50,588 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:47:50,588 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:47:50,588 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:47:50,588 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:47:50,589 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:47:50,589 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:47:50,589 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:47:50,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-11-10 04:47:50,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 04:47:50,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:50,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:50,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:47:50,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:47:50,621 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:47:50,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-11-10 04:47:50,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 04:47:50,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:50,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:50,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:47:50,625 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:47:50,630 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 20#L81-4true [2018-11-10 04:47:50,630 INFO L795 eck$LassoCheckResult]: Loop: 20#L81-4true assume true; 10#L81-1true assume !!(main_~i~1 < 8); 30#L82true SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 28#L82-1true havoc main_#t~nondet20; 21#L81-3true main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 20#L81-4true [2018-11-10 04:47:50,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:50,635 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 04:47:50,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:50,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:50,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 04:47:50,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:50,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:50,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:50,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 04:47:50,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:50,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:50,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:50,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:50,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:50,886 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:47:50,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:47:50,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:47:50,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:47:50,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:47:50,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:47:50,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:47:50,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:47:50,889 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 04:47:50,889 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:47:50,889 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:47:50,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:50,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:50,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:50,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:50,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:50,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:51,230 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:47:51,233 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:47:51,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:51,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:51,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:51,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:51,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:51,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:51,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:51,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:51,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:51,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:51,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:51,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:51,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:51,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:51,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:51,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:51,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:51,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:51,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:51,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:51,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:51,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:51,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:51,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:51,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:51,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:51,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:51,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:51,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:51,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:51,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:51,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:51,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:51,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:51,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:51,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:51,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:51,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:51,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:51,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:51,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:51,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:51,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:51,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:51,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:51,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:51,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:51,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:51,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:51,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:51,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:51,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:51,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:51,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:51,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:51,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:51,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:51,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:51,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:51,310 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:47:51,344 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 04:47:51,344 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 04:47:51,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:47:51,348 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:47:51,348 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:47:51,348 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 15 Supporting invariants [] [2018-11-10 04:47:51,359 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 04:47:51,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:51,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:51,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:51,410 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-10 04:47:51,419 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-10 04:47:51,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states. Second operand 4 states. [2018-11-10 04:47:51,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states.. Second operand 4 states. Result 153 states and 202 transitions. Complement of second has 7 states. [2018-11-10 04:47:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:47:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:47:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2018-11-10 04:47:51,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 135 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 04:47:51,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:47:51,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 135 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 04:47:51,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:47:51,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 135 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 04:47:51,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:47:51,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 202 transitions. [2018-11-10 04:47:51,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:51,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 50 states and 61 transitions. [2018-11-10 04:47:51,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-10 04:47:51,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:51,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2018-11-10 04:47:51,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:51,496 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-10 04:47:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2018-11-10 04:47:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-10 04:47:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 04:47:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-10 04:47:51,519 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-10 04:47:51,519 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-10 04:47:51,519 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:47:51,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 61 transitions. [2018-11-10 04:47:51,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:51,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:51,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:51,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:51,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:51,522 INFO L793 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 289#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 290#L81-4 assume true; 302#L81-1 assume !(main_~i~1 < 8); 303#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 291#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 292#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 280#L53-3 [2018-11-10 04:47:51,522 INFO L795 eck$LassoCheckResult]: Loop: 280#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 281#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 311#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 297#L56 assume !parse_expression_list_#t~switch3; 298#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 285#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 286#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 280#L53-3 [2018-11-10 04:47:51,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1805896786, now seen corresponding path program 1 times [2018-11-10 04:47:51,523 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:51,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:51,558 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-10 04:47:51,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:47:51,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:47:51,561 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:47:51,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 1 times [2018-11-10 04:47:51,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:51,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:51,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:51,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:51,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:47:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:47:51,633 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-10 04:47:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:51,645 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-10 04:47:51,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:47:51,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-11-10 04:47:51,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:51,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 64 transitions. [2018-11-10 04:47:51,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:47:51,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:51,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 64 transitions. [2018-11-10 04:47:51,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:51,649 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-10 04:47:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 64 transitions. [2018-11-10 04:47:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-10 04:47:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 04:47:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-11-10 04:47:51,652 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-10 04:47:51,652 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-10 04:47:51,652 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:47:51,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 60 transitions. [2018-11-10 04:47:51,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:51,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:51,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:51,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:51,654 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:51,654 INFO L793 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 400#L81-4 assume true; 415#L81-1 assume !!(main_~i~1 < 8); 391#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 389#L82-1 havoc main_#t~nondet20; 390#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 426#L81-4 assume true; 413#L81-1 assume !(main_~i~1 < 8); 414#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 402#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 403#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 392#L53-3 [2018-11-10 04:47:51,654 INFO L795 eck$LassoCheckResult]: Loop: 392#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 393#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 422#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 408#L56 assume !parse_expression_list_#t~switch3; 409#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 396#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 397#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 392#L53-3 [2018-11-10 04:47:51,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:51,654 INFO L82 PathProgramCache]: Analyzing trace with hash -651783153, now seen corresponding path program 1 times [2018-11-10 04:47:51,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:51,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:51,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:51,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:51,681 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-10 04:47:51,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:47:51,682 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/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-10 04:47:51,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:51,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:51,719 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-10 04:47:51,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:47:51,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 04:47:51,735 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:47:51,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:51,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 2 times [2018-11-10 04:47:51,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:51,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:51,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:47:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:47:51,822 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-10 04:47:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:51,838 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-10 04:47:51,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:47:51,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 70 transitions. [2018-11-10 04:47:51,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:51,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 69 transitions. [2018-11-10 04:47:51,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:47:51,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:51,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 69 transitions. [2018-11-10 04:47:51,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:51,844 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-10 04:47:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 69 transitions. [2018-11-10 04:47:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-11-10 04:47:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 04:47:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-11-10 04:47:51,847 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-11-10 04:47:51,847 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-11-10 04:47:51,847 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:47:51,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 65 transitions. [2018-11-10 04:47:51,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:51,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:51,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:51,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:51,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:51,849 INFO L793 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 551#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 552#L81-4 assume true; 577#L81-1 assume !!(main_~i~1 < 8); 583#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 582#L82-1 havoc main_#t~nondet20; 580#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 578#L81-4 assume true; 566#L81-1 assume !!(main_~i~1 < 8); 542#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 540#L82-1 havoc main_#t~nondet20; 541#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 581#L81-4 assume true; 564#L81-1 assume !(main_~i~1 < 8); 565#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 555#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 556#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 543#L53-3 [2018-11-10 04:47:51,849 INFO L795 eck$LassoCheckResult]: Loop: 543#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 544#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 573#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 560#L56 assume !parse_expression_list_#t~switch3; 561#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 547#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 548#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 543#L53-3 [2018-11-10 04:47:51,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1674320498, now seen corresponding path program 2 times [2018-11-10 04:47:51,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:51,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:51,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:51,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:51,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:47:51,879 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/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-10 04:47:51,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:47:51,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:47:51,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:47:51,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:51,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:47:51,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 04:47:51,938 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:47:51,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:51,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 3 times [2018-11-10 04:47:51,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:51,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:47:51,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:47:51,990 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-10 04:47:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:52,005 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-10 04:47:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:47:52,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 75 transitions. [2018-11-10 04:47:52,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 74 transitions. [2018-11-10 04:47:52,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:47:52,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:52,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2018-11-10 04:47:52,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:52,008 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-11-10 04:47:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2018-11-10 04:47:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-11-10 04:47:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 04:47:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2018-11-10 04:47:52,011 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2018-11-10 04:47:52,011 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2018-11-10 04:47:52,012 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:47:52,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 70 transitions. [2018-11-10 04:47:52,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:52,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:52,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,013 INFO L793 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 728#L81-4 assume true; 754#L81-1 assume !!(main_~i~1 < 8); 761#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 760#L82-1 havoc main_#t~nondet20; 757#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 758#L81-4 assume true; 762#L81-1 assume !!(main_~i~1 < 8); 765#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 764#L82-1 havoc main_#t~nondet20; 763#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 755#L81-4 assume true; 743#L81-1 assume !!(main_~i~1 < 8); 719#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 717#L82-1 havoc main_#t~nondet20; 718#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 759#L81-4 assume true; 741#L81-1 assume !(main_~i~1 < 8); 742#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 730#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 731#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 720#L53-3 [2018-11-10 04:47:52,013 INFO L795 eck$LassoCheckResult]: Loop: 720#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 721#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 750#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 736#L56 assume !parse_expression_list_#t~switch3; 737#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 724#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 725#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 720#L53-3 [2018-11-10 04:47:52,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash 177871343, now seen corresponding path program 3 times [2018-11-10 04:47:52,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:47:52,066 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:47:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:47:52,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 04:47:52,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:47:52,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:47:52,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 04:47:52,130 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:47:52,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 4 times [2018-11-10 04:47:52,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:52,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:52,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:47:52,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:47:52,174 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 04:47:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:52,192 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-10 04:47:52,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:47:52,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2018-11-10 04:47:52,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2018-11-10 04:47:52,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:47:52,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:52,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2018-11-10 04:47:52,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:52,196 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-11-10 04:47:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2018-11-10 04:47:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-10 04:47:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 04:47:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-11-10 04:47:52,201 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-11-10 04:47:52,201 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-11-10 04:47:52,201 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:47:52,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 75 transitions. [2018-11-10 04:47:52,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:52,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:52,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,203 INFO L793 eck$LassoCheckResult]: Stem: 952#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 931#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 932#L81-4 assume true; 957#L81-1 assume !!(main_~i~1 < 8); 973#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 972#L82-1 havoc main_#t~nondet20; 971#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 958#L81-4 assume true; 946#L81-1 assume !!(main_~i~1 < 8); 922#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 920#L82-1 havoc main_#t~nondet20; 921#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 960#L81-4 assume true; 970#L81-1 assume !!(main_~i~1 < 8); 969#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 968#L82-1 havoc main_#t~nondet20; 967#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 966#L81-4 assume true; 962#L81-1 assume !!(main_~i~1 < 8); 965#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 964#L82-1 havoc main_#t~nondet20; 963#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 961#L81-4 assume true; 944#L81-1 assume !(main_~i~1 < 8); 945#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 935#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 936#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 923#L53-3 [2018-11-10 04:47:52,203 INFO L795 eck$LassoCheckResult]: Loop: 923#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 924#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 953#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 939#L56 assume !parse_expression_list_#t~switch3; 940#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 927#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 928#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 923#L53-3 [2018-11-10 04:47:52,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1795080046, now seen corresponding path program 4 times [2018-11-10 04:47:52,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:47:52,244 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:47:52,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 04:47:52,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 04:47:52,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:47:52,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:47:52,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 04:47:52,304 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:47:52,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 5 times [2018-11-10 04:47:52,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:52,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:52,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:47:52,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:47:52,339 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-10 04:47:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:52,358 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-10 04:47:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:47:52,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 85 transitions. [2018-11-10 04:47:52,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 84 transitions. [2018-11-10 04:47:52,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:47:52,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:52,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 84 transitions. [2018-11-10 04:47:52,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:52,361 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-11-10 04:47:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 84 transitions. [2018-11-10 04:47:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-11-10 04:47:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 04:47:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-10 04:47:52,364 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-10 04:47:52,364 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-10 04:47:52,364 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:47:52,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 80 transitions. [2018-11-10 04:47:52,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:52,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:52,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,369 INFO L793 eck$LassoCheckResult]: Stem: 1181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 1160#L81-4 assume true; 1186#L81-1 assume !!(main_~i~1 < 8); 1207#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1206#L82-1 havoc main_#t~nondet20; 1205#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1187#L81-4 assume true; 1175#L81-1 assume !!(main_~i~1 < 8); 1151#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1149#L82-1 havoc main_#t~nondet20; 1150#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1189#L81-4 assume true; 1204#L81-1 assume !!(main_~i~1 < 8); 1203#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1202#L82-1 havoc main_#t~nondet20; 1201#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1200#L81-4 assume true; 1199#L81-1 assume !!(main_~i~1 < 8); 1198#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1197#L82-1 havoc main_#t~nondet20; 1196#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1195#L81-4 assume true; 1191#L81-1 assume !!(main_~i~1 < 8); 1194#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1193#L82-1 havoc main_#t~nondet20; 1192#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1190#L81-4 assume true; 1173#L81-1 assume !(main_~i~1 < 8); 1174#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 1162#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1163#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1152#L53-3 [2018-11-10 04:47:52,370 INFO L795 eck$LassoCheckResult]: Loop: 1152#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 1153#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 1182#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 1168#L56 assume !parse_expression_list_#t~switch3; 1169#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1156#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 1157#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 1152#L53-3 [2018-11-10 04:47:52,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1632094159, now seen corresponding path program 5 times [2018-11-10 04:47:52,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:52,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:47:52,444 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:47:52,456 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 04:47:52,477 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 04:47:52,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:47:52,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:47:52,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 04:47:52,506 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:47:52,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 6 times [2018-11-10 04:47:52,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:47:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:47:52,562 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-10 04:47:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:52,584 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-11-10 04:47:52,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:47:52,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 90 transitions. [2018-11-10 04:47:52,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 79 states and 89 transitions. [2018-11-10 04:47:52,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:47:52,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:52,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 89 transitions. [2018-11-10 04:47:52,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:52,586 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-11-10 04:47:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 89 transitions. [2018-11-10 04:47:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-11-10 04:47:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 04:47:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-10 04:47:52,588 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-10 04:47:52,588 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-10 04:47:52,588 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 04:47:52,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 85 transitions. [2018-11-10 04:47:52,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:52,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:52,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,590 INFO L793 eck$LassoCheckResult]: Stem: 1436#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 1415#L81-4 assume true; 1441#L81-1 assume !!(main_~i~1 < 8); 1467#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1466#L82-1 havoc main_#t~nondet20; 1465#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1442#L81-4 assume true; 1430#L81-1 assume !!(main_~i~1 < 8); 1406#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1404#L82-1 havoc main_#t~nondet20; 1405#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1444#L81-4 assume true; 1464#L81-1 assume !!(main_~i~1 < 8); 1463#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1462#L82-1 havoc main_#t~nondet20; 1461#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1460#L81-4 assume true; 1459#L81-1 assume !!(main_~i~1 < 8); 1458#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1457#L82-1 havoc main_#t~nondet20; 1456#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1455#L81-4 assume true; 1454#L81-1 assume !!(main_~i~1 < 8); 1453#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1452#L82-1 havoc main_#t~nondet20; 1451#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1450#L81-4 assume true; 1446#L81-1 assume !!(main_~i~1 < 8); 1449#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1448#L82-1 havoc main_#t~nondet20; 1447#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1445#L81-4 assume true; 1428#L81-1 assume !(main_~i~1 < 8); 1429#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 1417#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1418#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1407#L53-3 [2018-11-10 04:47:52,590 INFO L795 eck$LassoCheckResult]: Loop: 1407#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 1408#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 1437#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 1423#L56 assume !parse_expression_list_#t~switch3; 1424#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1411#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 1412#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 1407#L53-3 [2018-11-10 04:47:52,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash 387268274, now seen corresponding path program 6 times [2018-11-10 04:47:52,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:52,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:47:52,674 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:47:52,688 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 04:47:52,721 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 04:47:52,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:47:52,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:47:52,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-10 04:47:52,747 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:47:52,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 7 times [2018-11-10 04:47:52,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:47:52,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:47:52,798 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-11-10 04:47:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:52,822 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-10 04:47:52,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:47:52,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 95 transitions. [2018-11-10 04:47:52,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 84 states and 94 transitions. [2018-11-10 04:47:52,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:47:52,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:52,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 94 transitions. [2018-11-10 04:47:52,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:52,824 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-11-10 04:47:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 94 transitions. [2018-11-10 04:47:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-11-10 04:47:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 04:47:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-10 04:47:52,827 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-10 04:47:52,828 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-10 04:47:52,828 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 04:47:52,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 90 transitions. [2018-11-10 04:47:52,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:52,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:52,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:52,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:52,830 INFO L793 eck$LassoCheckResult]: Stem: 1717#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1696#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 1697#L81-4 assume true; 1722#L81-1 assume !!(main_~i~1 < 8); 1753#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1752#L82-1 havoc main_#t~nondet20; 1751#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1723#L81-4 assume true; 1711#L81-1 assume !!(main_~i~1 < 8); 1687#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1685#L82-1 havoc main_#t~nondet20; 1686#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1725#L81-4 assume true; 1750#L81-1 assume !!(main_~i~1 < 8); 1749#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1748#L82-1 havoc main_#t~nondet20; 1747#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1746#L81-4 assume true; 1745#L81-1 assume !!(main_~i~1 < 8); 1744#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1743#L82-1 havoc main_#t~nondet20; 1742#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1741#L81-4 assume true; 1740#L81-1 assume !!(main_~i~1 < 8); 1739#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1738#L82-1 havoc main_#t~nondet20; 1737#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1736#L81-4 assume true; 1735#L81-1 assume !!(main_~i~1 < 8); 1734#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1733#L82-1 havoc main_#t~nondet20; 1732#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1731#L81-4 assume true; 1727#L81-1 assume !!(main_~i~1 < 8); 1730#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1729#L82-1 havoc main_#t~nondet20; 1728#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 1726#L81-4 assume true; 1709#L81-1 assume !(main_~i~1 < 8); 1710#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 1700#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1701#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1688#L53-3 [2018-11-10 04:47:52,830 INFO L795 eck$LassoCheckResult]: Loop: 1688#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 1689#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 1718#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 1704#L56 assume !parse_expression_list_#t~switch3; 1705#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1692#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 1693#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 1688#L53-3 [2018-11-10 04:47:52,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash -660759121, now seen corresponding path program 7 times [2018-11-10 04:47:52,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:52,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:52,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:47:52,925 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:47:52,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:52,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:47:53,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:47:53,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 04:47:53,009 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:47:53,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 8 times [2018-11-10 04:47:53,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:53,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:53,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:53,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:47:53,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:47:53,065 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-10 04:47:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:53,092 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-11-10 04:47:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:47:53,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 97 transitions. [2018-11-10 04:47:53,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:53,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 86 states and 96 transitions. [2018-11-10 04:47:53,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:47:53,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:47:53,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 96 transitions. [2018-11-10 04:47:53,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:53,095 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-11-10 04:47:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 96 transitions. [2018-11-10 04:47:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-10 04:47:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 04:47:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-11-10 04:47:53,101 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-11-10 04:47:53,102 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-11-10 04:47:53,102 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 04:47:53,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 95 transitions. [2018-11-10 04:47:53,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 04:47:53,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:53,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:53,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:53,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:53,104 INFO L793 eck$LassoCheckResult]: Stem: 2022#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2001#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 2002#L81-4 assume true; 2027#L81-1 assume !!(main_~i~1 < 8); 2062#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1989#L82-1 havoc main_#t~nondet20; 1990#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2028#L81-4 assume true; 2016#L81-1 assume !!(main_~i~1 < 8); 1991#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 1992#L82-1 havoc main_#t~nondet20; 2061#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2060#L81-4 assume true; 2059#L81-1 assume !!(main_~i~1 < 8); 2058#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2057#L82-1 havoc main_#t~nondet20; 2056#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2055#L81-4 assume true; 2054#L81-1 assume !!(main_~i~1 < 8); 2053#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2052#L82-1 havoc main_#t~nondet20; 2051#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2050#L81-4 assume true; 2049#L81-1 assume !!(main_~i~1 < 8); 2048#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2047#L82-1 havoc main_#t~nondet20; 2046#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2045#L81-4 assume true; 2044#L81-1 assume !!(main_~i~1 < 8); 2043#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2042#L82-1 havoc main_#t~nondet20; 2041#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2040#L81-4 assume true; 2039#L81-1 assume !!(main_~i~1 < 8); 2038#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2037#L82-1 havoc main_#t~nondet20; 2036#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2035#L81-4 assume true; 2031#L81-1 assume !!(main_~i~1 < 8); 2034#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2033#L82-1 havoc main_#t~nondet20; 2032#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2030#L81-4 assume true; 2014#L81-1 assume !(main_~i~1 < 8); 2015#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 2003#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2004#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1993#L53-3 [2018-11-10 04:47:53,104 INFO L795 eck$LassoCheckResult]: Loop: 1993#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 1994#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 2023#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 2009#L56 assume !parse_expression_list_#t~switch3; 2010#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1997#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 1998#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 1993#L53-3 [2018-11-10 04:47:53,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:53,104 INFO L82 PathProgramCache]: Analyzing trace with hash -480635694, now seen corresponding path program 8 times [2018-11-10 04:47:53,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:53,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:53,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:53,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:53,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:53,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:53,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1692661628, now seen corresponding path program 9 times [2018-11-10 04:47:53,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:53,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:53,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:53,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2066147693, now seen corresponding path program 1 times [2018-11-10 04:47:53,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:53,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:53,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:47:53,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:58,246 WARN L179 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 210 DAG size of output: 166 [2018-11-10 04:47:58,550 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 04:47:58,552 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:47:58,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:47:58,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:47:58,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:47:58,553 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:47:58,553 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:47:58,553 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:47:58,553 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:47:58,553 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration10_Lasso [2018-11-10 04:47:58,553 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:47:58,553 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:47:58,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,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-10 04:47:58,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-10 04:47:58,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,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-10 04:47:58,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-10 04:47:58,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,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-10 04:47:58,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,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-10 04:47:58,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:47:58,950 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:47:58,950 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:47:58,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:58,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:58,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:58,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:58,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:58,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:58,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,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-10 04:47:58,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:58,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:58,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:58,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:58,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:58,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,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-10 04:47:58,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:58,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:58,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,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-10 04:47:58,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:58,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:58,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,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-10 04:47:58,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:58,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:58,979 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:58,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:58,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:58,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:58,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:58,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:58,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:58,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:58,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:58,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:58,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:58,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:58,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:58,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:58,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:58,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:58,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:58,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:58,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:58,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,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-10 04:47:59,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:59,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:59,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,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-10 04:47:59,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:59,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:59,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:59,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:59,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:59,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:59,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:59,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:59,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:59,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:59,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,108 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:47:59,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,109 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:47:59,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:59,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:47:59,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:47:59,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:47:59,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:47:59,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:47:59,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:47:59,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:47:59,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:47:59,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:47:59,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:47:59,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:47:59,128 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:47:59,138 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:47:59,138 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:47:59,138 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:47:59,139 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:47:59,140 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:47:59,140 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~i~0) = -1*ULTIMATE.start_parse_expression_list_~str.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2018-11-10 04:47:59,170 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 04:47:59,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:47:59,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:59,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:59,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:47:59,252 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-10 04:47:59,252 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-10 04:47:59,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 95 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 04:47:59,307 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 95 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 124 states and 143 transitions. Complement of second has 6 states. [2018-11-10 04:47:59,307 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-10 04:47:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:47:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-10 04:47:59,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 47 letters. Loop has 7 letters. [2018-11-10 04:47:59,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:47:59,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 54 letters. Loop has 7 letters. [2018-11-10 04:47:59,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:47:59,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 47 letters. Loop has 14 letters. [2018-11-10 04:47:59,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:47:59,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 143 transitions. [2018-11-10 04:47:59,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:47:59,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 107 states and 123 transitions. [2018-11-10 04:47:59,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 04:47:59,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 04:47:59,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 123 transitions. [2018-11-10 04:47:59,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:59,312 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 123 transitions. [2018-11-10 04:47:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 123 transitions. [2018-11-10 04:47:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-10 04:47:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 04:47:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2018-11-10 04:47:59,316 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 123 transitions. [2018-11-10 04:47:59,316 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 123 transitions. [2018-11-10 04:47:59,316 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 04:47:59,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 123 transitions. [2018-11-10 04:47:59,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:47:59,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:59,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:59,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:59,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:47:59,318 INFO L793 eck$LassoCheckResult]: Stem: 2460#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 2433#L81-4 assume true; 2467#L81-1 assume !!(main_~i~1 < 8); 2503#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2502#L82-1 havoc main_#t~nondet20; 2470#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2468#L81-4 assume true; 2454#L81-1 assume !!(main_~i~1 < 8); 2424#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2417#L82-1 havoc main_#t~nondet20; 2418#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2501#L81-4 assume true; 2500#L81-1 assume !!(main_~i~1 < 8); 2499#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2498#L82-1 havoc main_#t~nondet20; 2497#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2496#L81-4 assume true; 2495#L81-1 assume !!(main_~i~1 < 8); 2494#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2493#L82-1 havoc main_#t~nondet20; 2492#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2491#L81-4 assume true; 2490#L81-1 assume !!(main_~i~1 < 8); 2489#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2488#L82-1 havoc main_#t~nondet20; 2487#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2486#L81-4 assume true; 2485#L81-1 assume !!(main_~i~1 < 8); 2484#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2483#L82-1 havoc main_#t~nondet20; 2482#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2481#L81-4 assume true; 2480#L81-1 assume !!(main_~i~1 < 8); 2479#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2478#L82-1 havoc main_#t~nondet20; 2477#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2476#L81-4 assume true; 2472#L81-1 assume !!(main_~i~1 < 8); 2475#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2474#L82-1 havoc main_#t~nondet20; 2473#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2471#L81-4 assume true; 2452#L81-1 assume !(main_~i~1 < 8); 2453#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 2434#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2435#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2419#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 2420#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 2461#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 2444#L56 assume parse_expression_list_#t~switch3; 2411#L57-9 [2018-11-10 04:47:59,318 INFO L795 eck$LassoCheckResult]: Loop: 2411#L57-9 assume true; 2412#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 2464#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 2462#L57-3 assume parse_expression_list_#t~short6; 2422#L57-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 2411#L57-9 [2018-11-10 04:47:59,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash -875757802, now seen corresponding path program 1 times [2018-11-10 04:47:59,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:59,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:59,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:59,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:59,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash 64955408, now seen corresponding path program 1 times [2018-11-10 04:47:59,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:59,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:59,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:59,352 INFO L82 PathProgramCache]: Analyzing trace with hash -13678053, now seen corresponding path program 1 times [2018-11-10 04:47:59,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:59,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:47:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 04:47:59,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:47:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 04:47:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:47:59,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:47:59,582 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. cyclomatic complexity: 20 Second operand 10 states. [2018-11-10 04:47:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:47:59,845 INFO L93 Difference]: Finished difference Result 166 states and 195 transitions. [2018-11-10 04:47:59,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 04:47:59,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 195 transitions. [2018-11-10 04:47:59,846 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 04:47:59,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 166 states and 195 transitions. [2018-11-10 04:47:59,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 04:47:59,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 04:47:59,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 195 transitions. [2018-11-10 04:47:59,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:47:59,847 INFO L705 BuchiCegarLoop]: Abstraction has 166 states and 195 transitions. [2018-11-10 04:47:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 195 transitions. [2018-11-10 04:47:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2018-11-10 04:47:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 04:47:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-11-10 04:47:59,850 INFO L728 BuchiCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-11-10 04:47:59,850 INFO L608 BuchiCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-11-10 04:47:59,851 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 04:47:59,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 137 transitions. [2018-11-10 04:47:59,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:47:59,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:47:59,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:47:59,852 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:59,852 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:47:59,852 INFO L793 eck$LassoCheckResult]: Stem: 2765#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2737#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 2738#L81-4 assume true; 2759#L81-1 assume !!(main_~i~1 < 8); 2729#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2721#L82-1 havoc main_#t~nondet20; 2722#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2774#L81-4 assume true; 2775#L81-1 assume !!(main_~i~1 < 8); 2810#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2809#L82-1 havoc main_#t~nondet20; 2808#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2807#L81-4 assume true; 2806#L81-1 assume !!(main_~i~1 < 8); 2805#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2804#L82-1 havoc main_#t~nondet20; 2803#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2802#L81-4 assume true; 2801#L81-1 assume !!(main_~i~1 < 8); 2800#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2799#L82-1 havoc main_#t~nondet20; 2798#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2797#L81-4 assume true; 2796#L81-1 assume !!(main_~i~1 < 8); 2795#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2794#L82-1 havoc main_#t~nondet20; 2793#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2792#L81-4 assume true; 2791#L81-1 assume !!(main_~i~1 < 8); 2790#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2789#L82-1 havoc main_#t~nondet20; 2788#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2787#L81-4 assume true; 2786#L81-1 assume !!(main_~i~1 < 8); 2785#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2784#L82-1 havoc main_#t~nondet20; 2783#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2782#L81-4 assume true; 2778#L81-1 assume !!(main_~i~1 < 8); 2781#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 2780#L82-1 havoc main_#t~nondet20; 2779#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 2777#L81-4 assume true; 2757#L81-1 assume !(main_~i~1 < 8); 2758#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 2739#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2740#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2723#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 2724#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 2815#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 2814#L56 assume parse_expression_list_#t~switch3; 2813#L57-9 assume true; 2812#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 2811#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 2767#L57-3 assume !parse_expression_list_#t~short6; 2734#L57-5 [2018-11-10 04:47:59,853 INFO L795 eck$LassoCheckResult]: Loop: 2734#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 2730#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 2727#L57-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 2715#L57-9 assume true; 2716#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 2769#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 2770#L57-3 assume !parse_expression_list_#t~short6; 2734#L57-5 [2018-11-10 04:47:59,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:59,853 INFO L82 PathProgramCache]: Analyzing trace with hash 276653437, now seen corresponding path program 1 times [2018-11-10 04:47:59,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:59,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:59,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:59,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:59,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:59,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1931051579, now seen corresponding path program 1 times [2018-11-10 04:47:59,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:59,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:59,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:47:59,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:47:59,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1942108479, now seen corresponding path program 1 times [2018-11-10 04:47:59,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:47:59,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:47:59,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:47:59,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:47:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 04:48:00,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:00,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 04:48:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:48:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:48:00,117 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. cyclomatic complexity: 22 Second operand 10 states. [2018-11-10 04:48:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:00,334 INFO L93 Difference]: Finished difference Result 166 states and 193 transitions. [2018-11-10 04:48:00,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:48:00,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 193 transitions. [2018-11-10 04:48:00,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 04:48:00,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 166 states and 193 transitions. [2018-11-10 04:48:00,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 04:48:00,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 04:48:00,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 193 transitions. [2018-11-10 04:48:00,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:00,337 INFO L705 BuchiCegarLoop]: Abstraction has 166 states and 193 transitions. [2018-11-10 04:48:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 193 transitions. [2018-11-10 04:48:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2018-11-10 04:48:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 04:48:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2018-11-10 04:48:00,340 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 143 transitions. [2018-11-10 04:48:00,340 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 143 transitions. [2018-11-10 04:48:00,340 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 04:48:00,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 143 transitions. [2018-11-10 04:48:00,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:48:00,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:00,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:00,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:00,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:00,342 INFO L793 eck$LassoCheckResult]: Stem: 3082#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3052#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 3053#L81-4 assume true; 3076#L81-1 assume !!(main_~i~1 < 8); 3037#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3035#L82-1 havoc main_#t~nondet20; 3036#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3093#L81-4 assume true; 3094#L81-1 assume !!(main_~i~1 < 8); 3131#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3130#L82-1 havoc main_#t~nondet20; 3129#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3128#L81-4 assume true; 3127#L81-1 assume !!(main_~i~1 < 8); 3126#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3125#L82-1 havoc main_#t~nondet20; 3124#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3123#L81-4 assume true; 3122#L81-1 assume !!(main_~i~1 < 8); 3121#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3120#L82-1 havoc main_#t~nondet20; 3119#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3118#L81-4 assume true; 3117#L81-1 assume !!(main_~i~1 < 8); 3116#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3115#L82-1 havoc main_#t~nondet20; 3114#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3113#L81-4 assume true; 3112#L81-1 assume !!(main_~i~1 < 8); 3111#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3110#L82-1 havoc main_#t~nondet20; 3109#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3108#L81-4 assume true; 3107#L81-1 assume !!(main_~i~1 < 8); 3106#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3105#L82-1 havoc main_#t~nondet20; 3104#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3103#L81-4 assume true; 3099#L81-1 assume !!(main_~i~1 < 8); 3102#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3101#L82-1 havoc main_#t~nondet20; 3100#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3098#L81-4 assume true; 3074#L81-1 assume !(main_~i~1 < 8); 3075#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 3055#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3056#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3038#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 3039#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 3088#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 3134#L56 assume !parse_expression_list_#t~switch3; 3068#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 3047#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 3048#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 3040#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 3041#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 3083#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 3065#L56 assume parse_expression_list_#t~switch3; 3066#L57-9 [2018-11-10 04:48:00,342 INFO L795 eck$LassoCheckResult]: Loop: 3066#L57-9 assume true; 3132#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 3089#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 3090#L57-3 assume parse_expression_list_#t~short6; 3045#L57-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 3066#L57-9 [2018-11-10 04:48:00,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1367132073, now seen corresponding path program 1 times [2018-11-10 04:48:00,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:00,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:00,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:00,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash 64955408, now seen corresponding path program 2 times [2018-11-10 04:48:00,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:00,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:00,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:00,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:00,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:00,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash 291484026, now seen corresponding path program 1 times [2018-11-10 04:48:00,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:00,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:00,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,623 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 252 DAG size of output: 193 [2018-11-10 04:48:04,772 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 04:48:04,773 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:04,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:04,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:04,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:04,774 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:04,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:04,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:04,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:04,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-10 04:48:04,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:04,774 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:04,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:04,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:05,170 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:05,171 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:05,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:05,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:05,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:05,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:05,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:05,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:05,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:05,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:05,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:05,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:05,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:05,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:05,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:05,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:05,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:05,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:05,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:05,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:05,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,192 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:05,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:05,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,206 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:05,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,207 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:05,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,218 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:05,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,219 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:05,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:05,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:05,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:05,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:05,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:05,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:05,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:05,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:05,232 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:05,241 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:48:05,242 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:48:05,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:05,243 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 04:48:05,243 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:05,243 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~start~0) = -2*ULTIMATE.start_parse_expression_list_~str.offset - 2*ULTIMATE.start_parse_expression_list_~start~0 + 17 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 + 9 >= 0] [2018-11-10 04:48:05,321 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-10 04:48:05,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:05,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:05,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 04:48:05,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:48:05,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:48:05,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:7 [2018-11-10 04:48:05,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:48:05,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:48:05,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 04:48:05,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:48:05,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 04:48:05,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:48:05,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:48:05,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-11-10 04:48:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:05,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:05,433 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-10 04:48:05,433 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 04:48:05,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 143 transitions. cyclomatic complexity: 22 Second operand 7 states. [2018-11-10 04:48:05,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 143 transitions. cyclomatic complexity: 22. Second operand 7 states. Result 311 states and 372 transitions. Complement of second has 9 states. [2018-11-10 04:48:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:48:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 04:48:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-10 04:48:05,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 83 transitions. Stem has 58 letters. Loop has 5 letters. [2018-11-10 04:48:05,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:05,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 83 transitions. Stem has 63 letters. Loop has 5 letters. [2018-11-10 04:48:05,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:05,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 83 transitions. Stem has 58 letters. Loop has 10 letters. [2018-11-10 04:48:05,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:05,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 311 states and 372 transitions. [2018-11-10 04:48:05,497 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-10 04:48:05,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 311 states to 247 states and 292 transitions. [2018-11-10 04:48:05,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-10 04:48:05,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-11-10 04:48:05,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 292 transitions. [2018-11-10 04:48:05,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:05,500 INFO L705 BuchiCegarLoop]: Abstraction has 247 states and 292 transitions. [2018-11-10 04:48:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 292 transitions. [2018-11-10 04:48:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 174. [2018-11-10 04:48:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-10 04:48:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 205 transitions. [2018-11-10 04:48:05,504 INFO L728 BuchiCegarLoop]: Abstraction has 174 states and 205 transitions. [2018-11-10 04:48:05,504 INFO L608 BuchiCegarLoop]: Abstraction has 174 states and 205 transitions. [2018-11-10 04:48:05,504 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 04:48:05,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 205 transitions. [2018-11-10 04:48:05,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:48:05,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:05,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:05,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:05,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:48:05,508 INFO L793 eck$LassoCheckResult]: Stem: 3775#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3746#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 3747#L81-4 assume true; 3785#L81-1 assume !!(main_~i~1 < 8); 3823#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3822#L82-1 havoc main_#t~nondet20; 3821#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3786#L81-4 assume true; 3769#L81-1 assume !!(main_~i~1 < 8); 3738#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3730#L82-1 havoc main_#t~nondet20; 3731#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3790#L81-4 assume true; 3820#L81-1 assume !!(main_~i~1 < 8); 3819#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3818#L82-1 havoc main_#t~nondet20; 3817#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3816#L81-4 assume true; 3815#L81-1 assume !!(main_~i~1 < 8); 3814#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3813#L82-1 havoc main_#t~nondet20; 3812#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3811#L81-4 assume true; 3810#L81-1 assume !!(main_~i~1 < 8); 3809#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3808#L82-1 havoc main_#t~nondet20; 3807#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3806#L81-4 assume true; 3805#L81-1 assume !!(main_~i~1 < 8); 3804#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3803#L82-1 havoc main_#t~nondet20; 3802#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3801#L81-4 assume true; 3800#L81-1 assume !!(main_~i~1 < 8); 3799#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3798#L82-1 havoc main_#t~nondet20; 3797#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3796#L81-4 assume true; 3792#L81-1 assume !!(main_~i~1 < 8); 3795#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 3794#L82-1 havoc main_#t~nondet20; 3793#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 3791#L81-4 assume true; 3767#L81-1 assume !(main_~i~1 < 8); 3768#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 3752#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3753#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3732#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 3733#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 3857#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 3758#L56 assume parse_expression_list_#t~switch3; 3722#L57-9 assume true; 3723#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 3859#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 3848#L57-3 assume !parse_expression_list_#t~short6; 3846#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 3833#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 3828#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 3826#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 3824#L58 assume parse_expression_list_#t~mem8 == 34;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post9 + 1;havoc parse_expression_list_#t~post9; 3712#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3762#L60-13 [2018-11-10 04:48:05,508 INFO L795 eck$LassoCheckResult]: Loop: 3762#L60-13 assume true; 3728#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 3714#L60-2 assume !parse_expression_list_#t~short13; 3715#L60-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;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; 3762#L60-13 [2018-11-10 04:48:05,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash -75938360, now seen corresponding path program 1 times [2018-11-10 04:48:05,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:05,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 04:48:05,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:05,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 04:48:05,709 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:05,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:05,709 INFO L82 PathProgramCache]: Analyzing trace with hash 3050121, now seen corresponding path program 1 times [2018-11-10 04:48:05,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:05,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:05,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:05,712 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-10 04:48:05,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:05,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:48:05,713 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:48:05,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:48:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:48:05,713 INFO L87 Difference]: Start difference. First operand 174 states and 205 transitions. cyclomatic complexity: 38 Second operand 3 states. [2018-11-10 04:48:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:05,723 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2018-11-10 04:48:05,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:48:05,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 206 transitions. [2018-11-10 04:48:05,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:48:05,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 175 states and 205 transitions. [2018-11-10 04:48:05,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-10 04:48:05,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-10 04:48:05,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 205 transitions. [2018-11-10 04:48:05,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:05,727 INFO L705 BuchiCegarLoop]: Abstraction has 175 states and 205 transitions. [2018-11-10 04:48:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 205 transitions. [2018-11-10 04:48:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-11-10 04:48:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 04:48:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 205 transitions. [2018-11-10 04:48:05,730 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 205 transitions. [2018-11-10 04:48:05,730 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 205 transitions. [2018-11-10 04:48:05,730 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 04:48:05,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 205 transitions. [2018-11-10 04:48:05,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:48:05,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:05,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:05,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:05,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:05,738 INFO L793 eck$LassoCheckResult]: Stem: 4140#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 4110#L81-4 assume true; 4150#L81-1 assume !!(main_~i~1 < 8); 4246#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4245#L82-1 havoc main_#t~nondet20; 4244#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4151#L81-4 assume true; 4132#L81-1 assume !!(main_~i~1 < 8); 4094#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4092#L82-1 havoc main_#t~nondet20; 4093#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4155#L81-4 assume true; 4243#L81-1 assume !!(main_~i~1 < 8); 4242#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4241#L82-1 havoc main_#t~nondet20; 4240#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4239#L81-4 assume true; 4238#L81-1 assume !!(main_~i~1 < 8); 4237#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4236#L82-1 havoc main_#t~nondet20; 4235#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4234#L81-4 assume true; 4233#L81-1 assume !!(main_~i~1 < 8); 4232#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4231#L82-1 havoc main_#t~nondet20; 4230#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4229#L81-4 assume true; 4228#L81-1 assume !!(main_~i~1 < 8); 4227#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4226#L82-1 havoc main_#t~nondet20; 4225#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4224#L81-4 assume true; 4223#L81-1 assume !!(main_~i~1 < 8); 4222#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4221#L82-1 havoc main_#t~nondet20; 4220#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4219#L81-4 assume true; 4215#L81-1 assume !!(main_~i~1 < 8); 4218#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4217#L82-1 havoc main_#t~nondet20; 4216#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4214#L81-4 assume true; 4130#L81-1 assume !(main_~i~1 < 8); 4131#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 4112#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4113#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4095#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4096#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 4198#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 4197#L56 assume parse_expression_list_#t~switch3; 4195#L57-9 assume true; 4193#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 4190#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 4188#L57-3 assume !parse_expression_list_#t~short6; 4186#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 4183#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 4174#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 4169#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 4156#L58 assume parse_expression_list_#t~mem8 == 34;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post9 + 1;havoc parse_expression_list_#t~post9; 4076#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4125#L60-13 [2018-11-10 04:48:05,738 INFO L795 eck$LassoCheckResult]: Loop: 4125#L60-13 assume true; 4090#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4078#L60-2 assume parse_expression_list_#t~short13; 4079#L60-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L60-3 4127#L60-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 4118#L60-5 assume parse_expression_list_#t~short12; 4119#L60-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 4135#L60-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;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; 4125#L60-13 [2018-11-10 04:48:05,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash -75938360, now seen corresponding path program 2 times [2018-11-10 04:48:05,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:05,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:05,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:05,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:05,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 04:48:05,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:05,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 04:48:05,947 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:05,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1034209713, now seen corresponding path program 1 times [2018-11-10 04:48:05,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:05,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:05,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:48:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:48:05,986 INFO L87 Difference]: Start difference. First operand 175 states and 205 transitions. cyclomatic complexity: 37 Second operand 10 states. [2018-11-10 04:48:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:06,174 INFO L93 Difference]: Finished difference Result 227 states and 261 transitions. [2018-11-10 04:48:06,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:48:06,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 261 transitions. [2018-11-10 04:48:06,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 04:48:06,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 211 states and 245 transitions. [2018-11-10 04:48:06,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-11-10 04:48:06,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2018-11-10 04:48:06,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 245 transitions. [2018-11-10 04:48:06,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:06,179 INFO L705 BuchiCegarLoop]: Abstraction has 211 states and 245 transitions. [2018-11-10 04:48:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 245 transitions. [2018-11-10 04:48:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 163. [2018-11-10 04:48:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 04:48:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2018-11-10 04:48:06,181 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 191 transitions. [2018-11-10 04:48:06,182 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 191 transitions. [2018-11-10 04:48:06,182 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 04:48:06,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 191 transitions. [2018-11-10 04:48:06,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:48:06,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:06,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:06,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:06,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:06,184 INFO L793 eck$LassoCheckResult]: Stem: 4566#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4535#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 4536#L81-4 assume true; 4558#L81-1 assume !!(main_~i~1 < 8); 4522#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4520#L82-1 havoc main_#t~nondet20; 4521#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4575#L81-4 assume true; 4576#L81-1 assume !!(main_~i~1 < 8); 4614#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4613#L82-1 havoc main_#t~nondet20; 4612#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4611#L81-4 assume true; 4610#L81-1 assume !!(main_~i~1 < 8); 4609#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4608#L82-1 havoc main_#t~nondet20; 4607#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4606#L81-4 assume true; 4605#L81-1 assume !!(main_~i~1 < 8); 4604#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4603#L82-1 havoc main_#t~nondet20; 4602#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4601#L81-4 assume true; 4600#L81-1 assume !!(main_~i~1 < 8); 4599#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4598#L82-1 havoc main_#t~nondet20; 4597#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4596#L81-4 assume true; 4595#L81-1 assume !!(main_~i~1 < 8); 4594#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4593#L82-1 havoc main_#t~nondet20; 4592#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4591#L81-4 assume true; 4590#L81-1 assume !!(main_~i~1 < 8); 4589#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4588#L82-1 havoc main_#t~nondet20; 4587#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4586#L81-4 assume true; 4582#L81-1 assume !!(main_~i~1 < 8); 4585#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4584#L82-1 havoc main_#t~nondet20; 4583#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4581#L81-4 assume true; 4556#L81-1 assume !(main_~i~1 < 8); 4557#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 4538#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4539#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4523#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4524#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 4567#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 4548#L56 assume parse_expression_list_#t~switch3; 4514#L57-9 assume true; 4515#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 4663#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 4568#L57-3 assume !parse_expression_list_#t~short6; 4533#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 4529#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 4527#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 4501#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 4502#L58 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 4505#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4551#L60-13 [2018-11-10 04:48:06,184 INFO L795 eck$LassoCheckResult]: Loop: 4551#L60-13 assume true; 4518#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4507#L60-2 assume parse_expression_list_#t~short13; 4508#L60-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L60-3 4553#L60-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 4544#L60-5 assume parse_expression_list_#t~short12; 4545#L60-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 4561#L60-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;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; 4551#L60-13 [2018-11-10 04:48:06,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,184 INFO L82 PathProgramCache]: Analyzing trace with hash -75938298, now seen corresponding path program 1 times [2018-11-10 04:48:06,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:06,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1034209713, now seen corresponding path program 2 times [2018-11-10 04:48:06,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash -796612780, now seen corresponding path program 1 times [2018-11-10 04:48:06,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 04:48:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:48:06,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:48:06,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:48:06,298 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. cyclomatic complexity: 35 Second operand 6 states. [2018-11-10 04:48:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:06,338 INFO L93 Difference]: Finished difference Result 229 states and 266 transitions. [2018-11-10 04:48:06,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:48:06,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 266 transitions. [2018-11-10 04:48:06,340 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2018-11-10 04:48:06,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 215 states and 252 transitions. [2018-11-10 04:48:06,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-10 04:48:06,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-10 04:48:06,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 252 transitions. [2018-11-10 04:48:06,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:06,341 INFO L705 BuchiCegarLoop]: Abstraction has 215 states and 252 transitions. [2018-11-10 04:48:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 252 transitions. [2018-11-10 04:48:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 167. [2018-11-10 04:48:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 04:48:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2018-11-10 04:48:06,344 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 194 transitions. [2018-11-10 04:48:06,344 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 194 transitions. [2018-11-10 04:48:06,344 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 04:48:06,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 194 transitions. [2018-11-10 04:48:06,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 04:48:06,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:06,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:06,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:06,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:06,346 INFO L793 eck$LassoCheckResult]: Stem: 4979#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4945#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 4946#L81-4 assume true; 4971#L81-1 assume !!(main_~i~1 < 8); 4931#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4929#L82-1 havoc main_#t~nondet20; 4930#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4987#L81-4 assume true; 4988#L81-1 assume !!(main_~i~1 < 8); 5026#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5025#L82-1 havoc main_#t~nondet20; 5024#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5023#L81-4 assume true; 5022#L81-1 assume !!(main_~i~1 < 8); 5021#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5020#L82-1 havoc main_#t~nondet20; 5019#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5018#L81-4 assume true; 5017#L81-1 assume !!(main_~i~1 < 8); 5016#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5015#L82-1 havoc main_#t~nondet20; 5014#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5013#L81-4 assume true; 5012#L81-1 assume !!(main_~i~1 < 8); 5011#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5010#L82-1 havoc main_#t~nondet20; 5009#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5008#L81-4 assume true; 5007#L81-1 assume !!(main_~i~1 < 8); 5006#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5005#L82-1 havoc main_#t~nondet20; 5004#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5003#L81-4 assume true; 5002#L81-1 assume !!(main_~i~1 < 8); 5001#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5000#L82-1 havoc main_#t~nondet20; 4999#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4998#L81-4 assume true; 4993#L81-1 assume !!(main_~i~1 < 8); 4997#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 4996#L82-1 havoc main_#t~nondet20; 4995#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 4992#L81-4 assume true; 4969#L81-1 assume !(main_~i~1 < 8); 4970#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 4948#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4949#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4932#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4933#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 5038#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 5036#L56 assume !parse_expression_list_#t~switch3; 5037#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 5058#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 5056#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 5054#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 5053#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 5051#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 5052#L56 assume parse_expression_list_#t~switch3; 5064#L57-9 assume true; 4925#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 5069#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 4981#L57-3 assume parse_expression_list_#t~short6; 4936#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 4910#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 4911#L58 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 4914#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4962#L60-13 [2018-11-10 04:48:06,346 INFO L795 eck$LassoCheckResult]: Loop: 4962#L60-13 assume true; 4927#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4916#L60-2 assume parse_expression_list_#t~short13; 4917#L60-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L60-3 4965#L60-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 4954#L60-5 assume parse_expression_list_#t~short12; 4955#L60-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 4974#L60-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;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; 4962#L60-13 [2018-11-10 04:48:06,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash -823255772, now seen corresponding path program 1 times [2018-11-10 04:48:06,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:06,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 04:48:06,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:06,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:48:06,369 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:06,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1034209713, now seen corresponding path program 3 times [2018-11-10 04:48:06,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:06,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:48:06,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:48:06,431 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. cyclomatic complexity: 34 Second operand 3 states. [2018-11-10 04:48:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:06,439 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-10 04:48:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:48:06,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 198 transitions. [2018-11-10 04:48:06,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 04:48:06,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 171 states and 196 transitions. [2018-11-10 04:48:06,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 04:48:06,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 04:48:06,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 196 transitions. [2018-11-10 04:48:06,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:06,443 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 196 transitions. [2018-11-10 04:48:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 196 transitions. [2018-11-10 04:48:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-11-10 04:48:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 04:48:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2018-11-10 04:48:06,445 INFO L728 BuchiCegarLoop]: Abstraction has 171 states and 196 transitions. [2018-11-10 04:48:06,445 INFO L608 BuchiCegarLoop]: Abstraction has 171 states and 196 transitions. [2018-11-10 04:48:06,445 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 04:48:06,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 196 transitions. [2018-11-10 04:48:06,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 04:48:06,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:06,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:06,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:06,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:06,447 INFO L793 eck$LassoCheckResult]: Stem: 5324#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5293#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 5294#L81-4 assume true; 5331#L81-1 assume !!(main_~i~1 < 8); 5426#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5425#L82-1 havoc main_#t~nondet20; 5424#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5332#L81-4 assume true; 5316#L81-1 assume !!(main_~i~1 < 8); 5277#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5275#L82-1 havoc main_#t~nondet20; 5276#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5335#L81-4 assume true; 5423#L81-1 assume !!(main_~i~1 < 8); 5422#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5421#L82-1 havoc main_#t~nondet20; 5420#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5419#L81-4 assume true; 5418#L81-1 assume !!(main_~i~1 < 8); 5417#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5416#L82-1 havoc main_#t~nondet20; 5415#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5414#L81-4 assume true; 5413#L81-1 assume !!(main_~i~1 < 8); 5412#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5411#L82-1 havoc main_#t~nondet20; 5410#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5409#L81-4 assume true; 5408#L81-1 assume !!(main_~i~1 < 8); 5407#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5406#L82-1 havoc main_#t~nondet20; 5405#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5404#L81-4 assume true; 5403#L81-1 assume !!(main_~i~1 < 8); 5402#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5401#L82-1 havoc main_#t~nondet20; 5400#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5399#L81-4 assume true; 5395#L81-1 assume !!(main_~i~1 < 8); 5398#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 5397#L82-1 havoc main_#t~nondet20; 5396#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 5394#L81-4 assume true; 5314#L81-1 assume !(main_~i~1 < 8); 5315#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 5295#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 5296#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 5278#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 5279#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 5325#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 5306#L56 assume !parse_expression_list_#t~switch3; 5307#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 5288#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 5289#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 5280#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 5281#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 5387#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 5305#L56 assume parse_expression_list_#t~switch3; 5268#L57-9 assume true; 5269#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 5328#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 5326#L57-3 assume !parse_expression_list_#t~short6; 5290#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 5285#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 5286#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 5256#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 5257#L58 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 5260#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 5308#L60-13 [2018-11-10 04:48:06,447 INFO L795 eck$LassoCheckResult]: Loop: 5308#L60-13 assume true; 5273#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 5262#L60-2 assume parse_expression_list_#t~short13; 5263#L60-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L60-3 5310#L60-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 5301#L60-5 assume parse_expression_list_#t~short12; 5302#L60-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 5319#L60-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;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; 5308#L60-13 [2018-11-10 04:48:06,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 747479559, now seen corresponding path program 1 times [2018-11-10 04:48:06,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1034209713, now seen corresponding path program 4 times [2018-11-10 04:48:06,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,485 INFO L82 PathProgramCache]: Analyzing trace with hash -641633707, now seen corresponding path program 1 times [2018-11-10 04:48:06,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 04:48:06,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:06,543 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:48:06,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:06,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 04:48:06,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:06,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 04:48:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:48:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:48:06,643 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. cyclomatic complexity: 32 Second operand 7 states. [2018-11-10 04:48:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:06,710 INFO L93 Difference]: Finished difference Result 314 states and 367 transitions. [2018-11-10 04:48:06,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:48:06,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 314 states and 367 transitions. [2018-11-10 04:48:06,712 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2018-11-10 04:48:06,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 314 states to 288 states and 335 transitions. [2018-11-10 04:48:06,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-10 04:48:06,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-11-10 04:48:06,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 335 transitions. [2018-11-10 04:48:06,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:06,714 INFO L705 BuchiCegarLoop]: Abstraction has 288 states and 335 transitions. [2018-11-10 04:48:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 335 transitions. [2018-11-10 04:48:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 237. [2018-11-10 04:48:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-10 04:48:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 274 transitions. [2018-11-10 04:48:06,717 INFO L728 BuchiCegarLoop]: Abstraction has 237 states and 274 transitions. [2018-11-10 04:48:06,717 INFO L608 BuchiCegarLoop]: Abstraction has 237 states and 274 transitions. [2018-11-10 04:48:06,717 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 04:48:06,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 274 transitions. [2018-11-10 04:48:06,718 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 04:48:06,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:06,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:06,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:06,719 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:06,719 INFO L793 eck$LassoCheckResult]: Stem: 6057#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 6024#L81-4 assume true; 6048#L81-1 assume !!(main_~i~1 < 8); 6008#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 6006#L82-1 havoc main_#t~nondet20; 6007#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 6066#L81-4 assume true; 6067#L81-1 assume !!(main_~i~1 < 8); 6108#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 6107#L82-1 havoc main_#t~nondet20; 6106#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 6105#L81-4 assume true; 6104#L81-1 assume !!(main_~i~1 < 8); 6103#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 6102#L82-1 havoc main_#t~nondet20; 6101#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 6100#L81-4 assume true; 6099#L81-1 assume !!(main_~i~1 < 8); 6098#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 6097#L82-1 havoc main_#t~nondet20; 6096#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 6095#L81-4 assume true; 6094#L81-1 assume !!(main_~i~1 < 8); 6093#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 6092#L82-1 havoc main_#t~nondet20; 6091#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 6090#L81-4 assume true; 6089#L81-1 assume !!(main_~i~1 < 8); 6088#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 6087#L82-1 havoc main_#t~nondet20; 6086#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 6085#L81-4 assume true; 6084#L81-1 assume !!(main_~i~1 < 8); 6083#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 6082#L82-1 havoc main_#t~nondet20; 6081#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 6080#L81-4 assume true; 6074#L81-1 assume !!(main_~i~1 < 8); 6078#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 6077#L82-1 havoc main_#t~nondet20; 6076#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 6073#L81-4 assume true; 6046#L81-1 assume !(main_~i~1 < 8); 6047#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 6026#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 6027#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 6009#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 6010#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 6150#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 6149#L56 assume !parse_expression_list_#t~switch3; 6148#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 6147#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 6146#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 6145#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 6144#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 6143#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 6141#L56 assume !parse_expression_list_#t~switch3; 6129#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 6138#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 6135#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 6133#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 6132#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 6130#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 6131#L56 assume parse_expression_list_#t~switch3; 6177#L57-9 assume true; 6176#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 6175#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 6173#L57-3 assume !parse_expression_list_#t~short6; 6172#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 6171#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 6169#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 6168#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 6153#L58 assume parse_expression_list_#t~mem8 == 34;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post9 + 1;havoc parse_expression_list_#t~post9; 5992#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 6040#L60-13 [2018-11-10 04:48:06,719 INFO L795 eck$LassoCheckResult]: Loop: 6040#L60-13 assume true; 6004#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 5994#L60-2 assume parse_expression_list_#t~short13; 5995#L60-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L60-3 6042#L60-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 6032#L60-5 assume parse_expression_list_#t~short12; 6033#L60-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 6051#L60-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;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; 6040#L60-13 [2018-11-10 04:48:06,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1325731160, now seen corresponding path program 1 times [2018-11-10 04:48:06,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:06,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1034209713, now seen corresponding path program 5 times [2018-11-10 04:48:06,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:06,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1122537974, now seen corresponding path program 1 times [2018-11-10 04:48:06,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:14,973 WARN L179 SmtUtils]: Spent 8.14 s on a formula simplification. DAG size of input: 307 DAG size of output: 220 [2018-11-10 04:48:15,160 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 04:48:15,162 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:15,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:15,162 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:15,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:15,162 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:15,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:15,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:15,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:15,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration19_Lasso [2018-11-10 04:48:15,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:15,163 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:15,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,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-10 04:48:15,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,668 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:15,668 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:15,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:15,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:15,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:15,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:15,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,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-10 04:48:15,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:15,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:15,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:15,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:15,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,707 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:15,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,708 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:15,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:15,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:15,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:15,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:15,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:15,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:15,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:15,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:15,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:15,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:15,734 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:15,744 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:48:15,745 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 04:48:15,745 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:15,745 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:48:15,746 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:15,746 INFO L519 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-10 04:48:15,880 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 04:48:15,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:15,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:15,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:15,942 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-10 04:48:15,942 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-10 04:48:15,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 237 states and 274 transitions. cyclomatic complexity: 47 Second operand 5 states. [2018-11-10 04:48:16,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 237 states and 274 transitions. cyclomatic complexity: 47. Second operand 5 states. Result 491 states and 582 transitions. Complement of second has 11 states. [2018-11-10 04:48:16,038 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-10 04:48:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 04:48:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2018-11-10 04:48:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 113 transitions. Stem has 75 letters. Loop has 8 letters. [2018-11-10 04:48:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 113 transitions. Stem has 83 letters. Loop has 8 letters. [2018-11-10 04:48:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 113 transitions. Stem has 75 letters. Loop has 16 letters. [2018-11-10 04:48:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:16,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 491 states and 582 transitions. [2018-11-10 04:48:16,042 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-10 04:48:16,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 491 states to 330 states and 387 transitions. [2018-11-10 04:48:16,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-11-10 04:48:16,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2018-11-10 04:48:16,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 387 transitions. [2018-11-10 04:48:16,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:16,047 INFO L705 BuchiCegarLoop]: Abstraction has 330 states and 387 transitions. [2018-11-10 04:48:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 387 transitions. [2018-11-10 04:48:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 247. [2018-11-10 04:48:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 04:48:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2018-11-10 04:48:16,052 INFO L728 BuchiCegarLoop]: Abstraction has 247 states and 286 transitions. [2018-11-10 04:48:16,052 INFO L608 BuchiCegarLoop]: Abstraction has 247 states and 286 transitions. [2018-11-10 04:48:16,052 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 04:48:16,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 286 transitions. [2018-11-10 04:48:16,053 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 04:48:16,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:16,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:16,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:16,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:16,055 INFO L793 eck$LassoCheckResult]: Stem: 7108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7071#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 7072#L81-4 assume true; 7098#L81-1 assume !!(main_~i~1 < 8); 7060#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7052#L82-1 havoc main_#t~nondet20; 7053#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7116#L81-4 assume true; 7117#L81-1 assume !!(main_~i~1 < 8); 7154#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7153#L82-1 havoc main_#t~nondet20; 7152#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7151#L81-4 assume true; 7150#L81-1 assume !!(main_~i~1 < 8); 7149#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7148#L82-1 havoc main_#t~nondet20; 7147#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7146#L81-4 assume true; 7145#L81-1 assume !!(main_~i~1 < 8); 7144#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7143#L82-1 havoc main_#t~nondet20; 7142#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7141#L81-4 assume true; 7140#L81-1 assume !!(main_~i~1 < 8); 7139#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7138#L82-1 havoc main_#t~nondet20; 7137#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7136#L81-4 assume true; 7135#L81-1 assume !!(main_~i~1 < 8); 7134#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7133#L82-1 havoc main_#t~nondet20; 7132#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7131#L81-4 assume true; 7130#L81-1 assume !!(main_~i~1 < 8); 7129#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7128#L82-1 havoc main_#t~nondet20; 7127#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7126#L81-4 assume true; 7122#L81-1 assume !!(main_~i~1 < 8); 7125#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7124#L82-1 havoc main_#t~nondet20; 7123#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7121#L81-4 assume true; 7096#L81-1 assume !(main_~i~1 < 8); 7097#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 7077#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 7078#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 7056#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 7057#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 7202#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 7199#L56 assume parse_expression_list_#t~switch3; 7200#L57-9 assume true; 7232#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 7231#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 7229#L57-3 assume !parse_expression_list_#t~short6; 7227#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 7225#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 7223#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 7221#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 7217#L58 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 7216#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 7215#L60-13 assume true; 7214#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 7213#L60-2 assume !parse_expression_list_#t~short13; 7212#L60-11 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~mem11; 7211#L60-14 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 7209#L61 assume !parse_expression_list_#t~short16; 7207#L61-4 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 7206#L61-6 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 7205#L63 assume !(parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1;havoc r_strncpy_#res.base, r_strncpy_#res.offset;parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy_#res.base, r_strncpy_#res.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 7204#L5 assume !(__VERIFIER_assert_~cond == 0); 7203#L5-2 assume { :end_inline___VERIFIER_assert } true; 7201#L68 SUMMARY for call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1) * 1, 1); srcloc: L68 7198#L68-1 parse_expression_list_~start~0 := parse_expression_list_~i~0 + 1; 7196#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 7194#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 7192#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 7190#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 7188#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 7186#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 7187#L56 assume parse_expression_list_#t~switch3; 7250#L57-9 [2018-11-10 04:48:16,055 INFO L795 eck$LassoCheckResult]: Loop: 7250#L57-9 assume true; 7249#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 7248#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 7247#L57-3 assume parse_expression_list_#t~short6; 7062#L57-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 7250#L57-9 [2018-11-10 04:48:16,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash -295533812, now seen corresponding path program 1 times [2018-11-10 04:48:16,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:16,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-10 04:48:16,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:16,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:48:16,143 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:16,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash 64955408, now seen corresponding path program 3 times [2018-11-10 04:48:16,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:16,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:48:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:48:16,186 INFO L87 Difference]: Start difference. First operand 247 states and 286 transitions. cyclomatic complexity: 49 Second operand 7 states. [2018-11-10 04:48:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:16,289 INFO L93 Difference]: Finished difference Result 217 states and 249 transitions. [2018-11-10 04:48:16,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:48:16,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 249 transitions. [2018-11-10 04:48:16,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 04:48:16,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 197 states and 227 transitions. [2018-11-10 04:48:16,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 04:48:16,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 04:48:16,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 227 transitions. [2018-11-10 04:48:16,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:16,292 INFO L705 BuchiCegarLoop]: Abstraction has 197 states and 227 transitions. [2018-11-10 04:48:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 227 transitions. [2018-11-10 04:48:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-11-10 04:48:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 04:48:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 227 transitions. [2018-11-10 04:48:16,298 INFO L728 BuchiCegarLoop]: Abstraction has 197 states and 227 transitions. [2018-11-10 04:48:16,298 INFO L608 BuchiCegarLoop]: Abstraction has 197 states and 227 transitions. [2018-11-10 04:48:16,298 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 04:48:16,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 227 transitions. [2018-11-10 04:48:16,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 04:48:16,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:16,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:16,300 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:16,300 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:16,300 INFO L793 eck$LassoCheckResult]: Stem: 7590#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7551#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 7552#L81-4 assume true; 7577#L81-1 assume !!(main_~i~1 < 8); 7536#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7534#L82-1 havoc main_#t~nondet20; 7535#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7597#L81-4 assume true; 7598#L81-1 assume !!(main_~i~1 < 8); 7649#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7648#L82-1 havoc main_#t~nondet20; 7647#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7646#L81-4 assume true; 7645#L81-1 assume !!(main_~i~1 < 8); 7644#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7643#L82-1 havoc main_#t~nondet20; 7642#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7641#L81-4 assume true; 7640#L81-1 assume !!(main_~i~1 < 8); 7639#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7637#L82-1 havoc main_#t~nondet20; 7635#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7631#L81-4 assume true; 7628#L81-1 assume !!(main_~i~1 < 8); 7627#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7626#L82-1 havoc main_#t~nondet20; 7624#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7623#L81-4 assume true; 7621#L81-1 assume !!(main_~i~1 < 8); 7619#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7617#L82-1 havoc main_#t~nondet20; 7615#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7612#L81-4 assume true; 7611#L81-1 assume !!(main_~i~1 < 8); 7610#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7609#L82-1 havoc main_#t~nondet20; 7608#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7607#L81-4 assume true; 7603#L81-1 assume !!(main_~i~1 < 8); 7606#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 7605#L82-1 havoc main_#t~nondet20; 7604#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 7602#L81-4 assume true; 7575#L81-1 assume !(main_~i~1 < 8); 7576#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 7555#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 7556#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 7537#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 7538#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 7591#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 7566#L56 assume !parse_expression_list_#t~switch3; 7567#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 7711#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 7709#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 7539#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 7540#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 7710#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 7708#L56 assume parse_expression_list_#t~switch3; 7529#L57-9 assume true; 7530#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 7705#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 7703#L57-3 assume !parse_expression_list_#t~short6; 7700#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 7698#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 7696#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 7694#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 7692#L58 assume parse_expression_list_#t~mem8 == 34;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post9 + 1;havoc parse_expression_list_#t~post9; 7520#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 7569#L60-13 assume true; 7574#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 7683#L60-2 assume !parse_expression_list_#t~short13; 7638#L60-11 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~mem11; 7636#L60-14 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 7633#L61 assume !parse_expression_list_#t~short16; 7630#L61-4 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 7596#L61-6 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 7553#L63 assume !(parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1;havoc r_strncpy_#res.base, r_strncpy_#res.offset;parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy_#res.base, r_strncpy_#res.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 7525#L5 assume !(__VERIFIER_assert_~cond == 0); 7526#L5-2 assume { :end_inline___VERIFIER_assert } true; 7572#L68 SUMMARY for call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1) * 1, 1); srcloc: L68 7599#L68-1 parse_expression_list_~start~0 := parse_expression_list_~i~0 + 1; 7600#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 7622#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 7620#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 7618#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 7616#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 7613#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 7565#L56 assume parse_expression_list_#t~switch3; 7527#L57-9 [2018-11-10 04:48:16,300 INFO L795 eck$LassoCheckResult]: Loop: 7527#L57-9 assume true; 7528#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 7594#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 7592#L57-3 assume parse_expression_list_#t~short6; 7541#L57-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 7527#L57-9 [2018-11-10 04:48:16,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,301 INFO L82 PathProgramCache]: Analyzing trace with hash -985768113, now seen corresponding path program 1 times [2018-11-10 04:48:16,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 04:48:16,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:16,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 04:48:16,396 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:16,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash 64955408, now seen corresponding path program 4 times [2018-11-10 04:48:16,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:48:16,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:48:16,434 INFO L87 Difference]: Start difference. First operand 197 states and 227 transitions. cyclomatic complexity: 38 Second operand 9 states. [2018-11-10 04:48:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:16,583 INFO L93 Difference]: Finished difference Result 327 states and 383 transitions. [2018-11-10 04:48:16,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:48:16,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 383 transitions. [2018-11-10 04:48:16,586 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2018-11-10 04:48:16,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 289 states and 336 transitions. [2018-11-10 04:48:16,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-10 04:48:16,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-10 04:48:16,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 336 transitions. [2018-11-10 04:48:16,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:16,588 INFO L705 BuchiCegarLoop]: Abstraction has 289 states and 336 transitions. [2018-11-10 04:48:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 336 transitions. [2018-11-10 04:48:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 230. [2018-11-10 04:48:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 04:48:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 266 transitions. [2018-11-10 04:48:16,592 INFO L728 BuchiCegarLoop]: Abstraction has 230 states and 266 transitions. [2018-11-10 04:48:16,592 INFO L608 BuchiCegarLoop]: Abstraction has 230 states and 266 transitions. [2018-11-10 04:48:16,592 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 04:48:16,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 266 transitions. [2018-11-10 04:48:16,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 04:48:16,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:16,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:16,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:16,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:16,595 INFO L793 eck$LassoCheckResult]: Stem: 8137#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8100#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~post19, main_~i~1, main_#t~ret21, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~1 := 0; 8101#L81-4 assume true; 8126#L81-1 assume !!(main_~i~1 < 8); 8085#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 8083#L82-1 havoc main_#t~nondet20; 8084#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 8145#L81-4 assume true; 8146#L81-1 assume !!(main_~i~1 < 8); 8190#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 8189#L82-1 havoc main_#t~nondet20; 8188#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 8187#L81-4 assume true; 8186#L81-1 assume !!(main_~i~1 < 8); 8185#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 8184#L82-1 havoc main_#t~nondet20; 8183#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 8182#L81-4 assume true; 8181#L81-1 assume !!(main_~i~1 < 8); 8180#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 8179#L82-1 havoc main_#t~nondet20; 8178#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 8177#L81-4 assume true; 8176#L81-1 assume !!(main_~i~1 < 8); 8175#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 8174#L82-1 havoc main_#t~nondet20; 8173#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 8172#L81-4 assume true; 8171#L81-1 assume !!(main_~i~1 < 8); 8170#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 8169#L82-1 havoc main_#t~nondet20; 8168#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 8167#L81-4 assume true; 8165#L81-1 assume !!(main_~i~1 < 8); 8164#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 8162#L82-1 havoc main_#t~nondet20; 8160#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 8158#L81-4 assume true; 8151#L81-1 assume !!(main_~i~1 < 8); 8154#L82 SUMMARY for call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1 * 1, 1); srcloc: L82 8153#L82-1 havoc main_#t~nondet20; 8152#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := main_#t~post19 + 1;havoc main_#t~post19; 8150#L81-4 assume true; 8124#L81-1 assume !(main_~i~1 < 8); 8125#L81-5 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L81-5 8105#L85 assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 8106#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 8086#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 8087#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 8138#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 8116#L56 assume !parse_expression_list_#t~switch3; 8117#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 8096#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 8097#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 8088#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 8089#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 8141#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 8236#L56 assume parse_expression_list_#t~switch3; 8237#L57-9 assume true; 8147#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 8143#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 8140#L57-3 assume !parse_expression_list_#t~short6; 8099#L57-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-5 8094#L57-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 8095#L57-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5; 8067#L57-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-10 8068#L58 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 8070#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 8119#L60-13 assume true; 8082#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 8073#L60-2 assume !parse_expression_list_#t~short13; 8074#L60-11 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~mem11; 8200#L60-14 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 8197#L61 assume !parse_expression_list_#t~short16; 8192#L61-4 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~short16; 8144#L61-6 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 8102#L63 assume !(parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1;havoc r_strncpy_#res.base, r_strncpy_#res.offset;parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy_#res.base, r_strncpy_#res.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 8075#L5 assume !(__VERIFIER_assert_~cond == 0); 8076#L5-2 assume { :end_inline___VERIFIER_assert } true; 8122#L68 SUMMARY for call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1) * 1, 1); srcloc: L68 8148#L68-1 parse_expression_list_~start~0 := parse_expression_list_~i~0 + 1; 8149#L55-2 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 8163#L53-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L53-1 8161#L74 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 8159#L53-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 8157#L55 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L55 8155#L55-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 8115#L56 assume parse_expression_list_#t~switch3; 8077#L57-9 [2018-11-10 04:48:16,595 INFO L795 eck$LassoCheckResult]: Loop: 8077#L57-9 assume true; 8078#L57-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L57-1 8142#L57-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 8139#L57-3 assume parse_expression_list_#t~short6; 8090#L57-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~mem5;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 8077#L57-9 [2018-11-10 04:48:16,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash -766913395, now seen corresponding path program 1 times [2018-11-10 04:48:16,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-10 04:48:16,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:16,706 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36984004-102b-4fce-9c78-7555841ed741/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:48:16,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:16,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:16,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:48:16,776 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:48:16,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 04:48:16,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:48:16,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:48:16,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 04:48:16,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-10 04:48:16,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 04:48:16,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:48:16,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:48:16,833 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-10 04:48:16,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2018-11-10 04:48:16,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-10 04:48:16,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-10 04:48:16,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:48:16,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 04:48:16,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:48:16,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:48:16,888 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-10 04:48:16,888 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2018-11-10 04:48:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-10 04:48:16,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:16,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-11-10 04:48:16,926 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:16,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash 64955408, now seen corresponding path program 5 times [2018-11-10 04:48:16,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 04:48:16,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-10 04:48:16,976 INFO L87 Difference]: Start difference. First operand 230 states and 266 transitions. cyclomatic complexity: 44 Second operand 12 states. [2018-11-10 04:48:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:17,147 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2018-11-10 04:48:17,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:48:17,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 181 transitions. [2018-11-10 04:48:17,148 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:48:17,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 0 states and 0 transitions. [2018-11-10 04:48:17,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:48:17,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:48:17,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:48:17,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:48:17,149 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:48:17,149 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:48:17,149 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:48:17,149 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 04:48:17,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:48:17,149 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:48:17,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:48:17,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:48:17 BoogieIcfgContainer [2018-11-10 04:48:17,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:48:17,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:48:17,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:48:17,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:48:17,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:47:50" (3/4) ... [2018-11-10 04:48:17,164 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:48:17,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:48:17,165 INFO L168 Benchmark]: Toolchain (without parser) took 27124.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -107.1 MB). Peak memory consumption was 265.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:17,166 INFO L168 Benchmark]: CDTParser took 0.14 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-10 04:48:17,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.94 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:17,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:17,167 INFO L168 Benchmark]: Boogie Preprocessor took 19.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:17,167 INFO L168 Benchmark]: RCFGBuilder took 246.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:17,168 INFO L168 Benchmark]: BuchiAutomizer took 26613.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:17,168 INFO L168 Benchmark]: Witness Printer took 5.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:48:17,174 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.14 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 174.94 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 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 62.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26613.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 22 terminating modules (18 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 15 and consists of 5 locations. One deterministic module has affine ranking function -1 * str + unknown-#length-unknown[str] + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * str + -2 * start + 17 and consists of 6 locations. One deterministic module has affine ranking function j and consists of 6 locations. 18 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.5s and 23 iterations. TraceHistogramMax:9. Analysis of lassos took 24.3s. Construction of modules took 0.7s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 21. Automata minimization 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 479 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 247 states and ocurred in iteration 19. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1192 SDtfs, 1984 SDslu, 3380 SDs, 0 SdLazy, 1269 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU13 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax100 hnf100 lsp91 ukn76 mio100 lsp42 div100 bol100 ite100 ukn100 eq186 hnf86 smp96 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 0 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...