./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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-5842f4b [2018-11-18 10:35:43,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:35:43,107 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:35:43,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:35:43,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:35:43,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:35:43,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:35:43,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:35:43,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:35:43,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:35:43,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:35:43,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:35:43,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:35:43,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:35:43,121 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:35:43,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:35:43,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:35:43,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:35:43,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:35:43,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:35:43,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:35:43,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:35:43,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:35:43,128 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:35:43,129 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:35:43,129 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:35:43,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:35:43,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:35:43,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:35:43,131 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:35:43,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:35:43,132 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:35:43,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:35:43,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:35:43,132 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:35:43,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:35:43,133 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:35:43,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:35:43,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:35:43,142 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:35:43,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:35:43,142 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:35:43,142 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:35:43,142 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:35:43,142 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:35:43,142 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:35:43,143 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:35:43,143 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:35:43,143 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:35:43,143 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:35:43,143 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:35:43,143 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:35:43,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:35:43,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:35:43,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:35:43,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:35:43,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:35:43,144 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:35:43,144 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:35:43,144 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:35:43,144 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:35:43,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:35:43,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:35:43,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:35:43,145 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:35:43,145 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:35:43,145 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:35:43,145 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:35:43,146 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:35:43,146 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_0af6bf72-343c-486f-ba39-c2aa902c30db/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-18 10:35:43,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:35:43,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:35:43,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:35:43,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:35:43,186 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:35:43,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/../../sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-18 10:35:43,233 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/data/0eadd7767/4baf95f0d7d544bc98415bacb5b0cc89/FLAGc03bf3319 [2018-11-18 10:35:43,603 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:35:43,604 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/sv-benchmarks/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-18 10:35:43,610 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/data/0eadd7767/4baf95f0d7d544bc98415bacb5b0cc89/FLAGc03bf3319 [2018-11-18 10:35:44,014 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/data/0eadd7767/4baf95f0d7d544bc98415bacb5b0cc89 [2018-11-18 10:35:44,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:35:44,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:35:44,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:35:44,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:35:44,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:35:44,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5102b6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44, skipping insertion in model container [2018-11-18 10:35:44,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:35:44,051 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:35:44,177 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:35:44,185 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:35:44,208 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:35:44,223 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:35:44,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44 WrapperNode [2018-11-18 10:35:44,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:35:44,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:35:44,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:35:44,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:35:44,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:35:44,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:35:44,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:35:44,301 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:35:44,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... [2018-11-18 10:35:44,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:35:44,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:35:44,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:35:44,324 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:35:44,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:35:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-18 10:35:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:35:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:35:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:35:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:35:44,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:35:44,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:35:44,634 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:35:44,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:35:44 BoogieIcfgContainer [2018-11-18 10:35:44,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:35:44,635 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:35:44,635 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:35:44,637 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:35:44,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:35:44,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:35:44" (1/3) ... [2018-11-18 10:35:44,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d6b1554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:35:44, skipping insertion in model container [2018-11-18 10:35:44,639 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:35:44,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:44" (2/3) ... [2018-11-18 10:35:44,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d6b1554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:35:44, skipping insertion in model container [2018-11-18 10:35:44,639 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:35:44,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:35:44" (3/3) ... [2018-11-18 10:35:44,641 INFO L375 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-18 10:35:44,683 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:35:44,684 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:35:44,684 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:35:44,684 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:35:44,684 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:35:44,684 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:35:44,684 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:35:44,684 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:35:44,684 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:35:44,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2018-11-18 10:35:44,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-18 10:35:44,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:44,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:44,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:35:44,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:35:44,717 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:35:44,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2018-11-18 10:35:44,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-18 10:35:44,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:44,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:44,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:35:44,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:35:44,726 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 38#L81-4true [2018-11-18 10:35:44,726 INFO L796 eck$LassoCheckResult]: Loop: 38#L81-4true assume true; 25#L81-1true assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 40#L81-3true main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 38#L81-4true [2018-11-18 10:35:44,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:44,730 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 10:35:44,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:44,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:44,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:44,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 10:35:44,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:44,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:44,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:44,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 10:35:44,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:44,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:44,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:44,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:44,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:44,967 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:35:44,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:35:44,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:35:44,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:35:44,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:35:44,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:35:44,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:35:44,969 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:35:44,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 10:35:44,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:35:44,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:35:44,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:44,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:45,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:45,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:45,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:45,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:45,160 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:35:45,164 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:35:45,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:45,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:45,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:45,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:45,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:45,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:45,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:45,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:45,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:45,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:45,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:45,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:45,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:45,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:45,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:45,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:45,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:45,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:45,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:45,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:45,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:45,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:45,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:45,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:45,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:45,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:45,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:45,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-18 10:35:45,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:45,179 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:35:45,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:45,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:45,181 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:35:45,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:45,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:45,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:45,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:45,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:45,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:45,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:45,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:45,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:45,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:45,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:45,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-18 10:35:45,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:45,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:45,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:45,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:45,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:45,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:45,228 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:35:45,249 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:35:45,249 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:35:45,251 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:35:45,253 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:35:45,253 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:35:45,254 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 15 Supporting invariants [] [2018-11-18 10:35:45,258 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 10:35:45,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:45,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:45,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:45,322 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:35:45,323 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states. Second operand 4 states. [2018-11-18 10:35:45,380 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states.. Second operand 4 states. Result 110 states and 159 transitions. Complement of second has 7 states. [2018-11-18 10:35:45,381 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-18 10:35:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:35:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2018-11-18 10:35:45,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 107 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 10:35:45,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:45,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 107 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 10:35:45,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:45,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 107 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 10:35:45,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:45,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 159 transitions. [2018-11-18 10:35:45,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:45,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 35 states and 46 transitions. [2018-11-18 10:35:45,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 10:35:45,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:45,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2018-11-18 10:35:45,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:45,397 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-18 10:35:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2018-11-18 10:35:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 10:35:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 10:35:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-11-18 10:35:45,417 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-18 10:35:45,417 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-18 10:35:45,417 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:35:45,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2018-11-18 10:35:45,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:45,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:45,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:45,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:35:45,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:45,419 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 212#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 213#L81-4 assume true; 218#L81-1 assume !(main_~i~1 < 8); 219#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 225#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 203#L53-4 [2018-11-18 10:35:45,419 INFO L796 eck$LassoCheckResult]: Loop: 203#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 204#L56 assume !parse_expression_list_#t~switch3; 210#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 211#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 206#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 203#L53-4 [2018-11-18 10:35:45,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 889538667, now seen corresponding path program 1 times [2018-11-18 10:35:45,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:45,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:35:45,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:35:45,452 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:45,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:45,452 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 1 times [2018-11-18 10:35:45,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:45,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:45,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:35:45,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:35:45,526 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-18 10:35:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:45,537 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-11-18 10:35:45,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:35:45,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2018-11-18 10:35:45,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:45,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 47 transitions. [2018-11-18 10:35:45,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 10:35:45,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:45,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2018-11-18 10:35:45,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:45,541 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-18 10:35:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2018-11-18 10:35:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-18 10:35:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 10:35:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-11-18 10:35:45,544 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-18 10:35:45,544 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-18 10:35:45,544 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:35:45,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-11-18 10:35:45,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:45,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:45,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:45,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:45,546 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:45,546 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 292#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 293#L81-4 assume true; 299#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 300#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 308#L81-4 assume true; 297#L81-1 assume !(main_~i~1 < 8); 298#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 304#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 282#L53-4 [2018-11-18 10:35:45,546 INFO L796 eck$LassoCheckResult]: Loop: 282#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 283#L56 assume !parse_expression_list_#t~switch3; 289#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 290#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 287#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 282#L53-4 [2018-11-18 10:35:45,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash 351309037, now seen corresponding path program 1 times [2018-11-18 10:35:45,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:45,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:45,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:45,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:45,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:35:45,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:35:45,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:45,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:45,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:35:45,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 10:35:45,620 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:45,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:45,621 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 2 times [2018-11-18 10:35:45,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:45,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:45,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:45,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:35:45,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:35:45,693 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 10:35:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:45,707 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-18 10:35:45,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:35:45,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2018-11-18 10:35:45,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:45,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 50 transitions. [2018-11-18 10:35:45,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 10:35:45,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:45,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2018-11-18 10:35:45,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:45,710 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-11-18 10:35:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2018-11-18 10:35:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-18 10:35:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 10:35:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-18 10:35:45,713 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-18 10:35:45,713 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-18 10:35:45,714 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:35:45,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2018-11-18 10:35:45,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:45,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:45,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:45,715 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 10:35:45,715 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:45,715 INFO L794 eck$LassoCheckResult]: Stem: 414#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 400#L81-4 assume true; 416#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 418#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 417#L81-4 assume true; 407#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 408#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 419#L81-4 assume true; 405#L81-1 assume !(main_~i~1 < 8); 406#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 412#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 390#L53-4 [2018-11-18 10:35:45,715 INFO L796 eck$LassoCheckResult]: Loop: 390#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 391#L56 assume !parse_expression_list_#t~switch3; 397#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 398#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 395#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 390#L53-4 [2018-11-18 10:35:45,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash -934682325, now seen corresponding path program 2 times [2018-11-18 10:35:45,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:45,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:45,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:45,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:45,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:35:45,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:35:45,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:35:45,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:35:45,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:35:45,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:45,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:35:45,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 10:35:45,805 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:45,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:45,805 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 3 times [2018-11-18 10:35:45,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:45,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:35:45,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:35:45,872 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 10:35:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:45,888 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-18 10:35:45,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:35:45,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2018-11-18 10:35:45,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:45,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 53 transitions. [2018-11-18 10:35:45,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 10:35:45,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:45,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-18 10:35:45,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:45,892 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-18 10:35:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-18 10:35:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-18 10:35:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 10:35:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2018-11-18 10:35:45,894 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-18 10:35:45,895 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-18 10:35:45,895 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:35:45,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2018-11-18 10:35:45,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:45,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:45,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:45,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1, 1] [2018-11-18 10:35:45,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:45,897 INFO L794 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 523#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 524#L81-4 assume true; 540#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 542#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 543#L81-4 assume true; 545#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 546#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 541#L81-4 assume true; 531#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 532#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 544#L81-4 assume true; 529#L81-1 assume !(main_~i~1 < 8); 530#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 536#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 514#L53-4 [2018-11-18 10:35:45,897 INFO L796 eck$LassoCheckResult]: Loop: 514#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 515#L56 assume !parse_expression_list_#t~switch3; 521#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 522#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 519#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 514#L53-4 [2018-11-18 10:35:45,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash -795067347, now seen corresponding path program 3 times [2018-11-18 10:35:45,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:45,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:45,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:35:45,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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-18 10:35:45,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:35:45,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 10:35:45,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:35:45,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:35:46,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 10:35:46,019 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:46,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,019 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 4 times [2018-11-18 10:35:46,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:35:46,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:35:46,082 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 10:35:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:46,112 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-11-18 10:35:46,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:35:46,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2018-11-18 10:35:46,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:46,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 46 states and 56 transitions. [2018-11-18 10:35:46,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 10:35:46,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:46,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-11-18 10:35:46,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:46,116 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-18 10:35:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-11-18 10:35:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-18 10:35:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 10:35:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-18 10:35:46,119 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-18 10:35:46,119 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-18 10:35:46,119 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:35:46,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2018-11-18 10:35:46,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:46,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:46,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:46,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1, 1] [2018-11-18 10:35:46,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:46,121 INFO L794 eck$LassoCheckResult]: Stem: 678#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 664#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 665#L81-4 assume true; 671#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 672#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 680#L81-4 assume true; 681#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 689#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 688#L81-4 assume true; 687#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 686#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 685#L81-4 assume true; 683#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 684#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 682#L81-4 assume true; 669#L81-1 assume !(main_~i~1 < 8); 670#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 676#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 654#L53-4 [2018-11-18 10:35:46,121 INFO L796 eck$LassoCheckResult]: Loop: 654#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 655#L56 assume !parse_expression_list_#t~switch3; 661#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 662#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 659#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 654#L53-4 [2018-11-18 10:35:46,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash 946399723, now seen corresponding path program 4 times [2018-11-18 10:35:46,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:35:46,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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-18 10:35:46,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 10:35:46,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 10:35:46,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:35:46,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:35:46,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 10:35:46,230 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:46,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 5 times [2018-11-18 10:35:46,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:35:46,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:35:46,280 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-18 10:35:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:46,308 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-18 10:35:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:35:46,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 60 transitions. [2018-11-18 10:35:46,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:46,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 49 states and 59 transitions. [2018-11-18 10:35:46,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 10:35:46,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:46,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 59 transitions. [2018-11-18 10:35:46,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:46,310 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-18 10:35:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 59 transitions. [2018-11-18 10:35:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-18 10:35:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 10:35:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-18 10:35:46,312 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-18 10:35:46,312 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-18 10:35:46,312 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:35:46,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 57 transitions. [2018-11-18 10:35:46,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:46,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:46,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:46,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1, 1] [2018-11-18 10:35:46,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:46,314 INFO L794 eck$LassoCheckResult]: Stem: 834#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 820#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 821#L81-4 assume true; 827#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 828#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 836#L81-4 assume true; 837#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 848#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 847#L81-4 assume true; 846#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 845#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 844#L81-4 assume true; 843#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 842#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 841#L81-4 assume true; 839#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 840#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 838#L81-4 assume true; 825#L81-1 assume !(main_~i~1 < 8); 826#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 832#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 810#L53-4 [2018-11-18 10:35:46,314 INFO L796 eck$LassoCheckResult]: Loop: 810#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 811#L56 assume !parse_expression_list_#t~switch3; 817#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 818#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 815#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 810#L53-4 [2018-11-18 10:35:46,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2081913709, now seen corresponding path program 5 times [2018-11-18 10:35:46,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:46,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:35:46,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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-18 10:35:46,384 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 10:35:46,399 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 10:35:46,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:35:46,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:35:46,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 10:35:46,425 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:46,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 6 times [2018-11-18 10:35:46,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:35:46,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:35:46,509 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-18 10:35:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:46,532 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-18 10:35:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:35:46,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 63 transitions. [2018-11-18 10:35:46,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:46,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 62 transitions. [2018-11-18 10:35:46,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 10:35:46,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:46,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 62 transitions. [2018-11-18 10:35:46,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:46,535 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-18 10:35:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 62 transitions. [2018-11-18 10:35:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-18 10:35:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 10:35:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-11-18 10:35:46,538 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-18 10:35:46,539 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-18 10:35:46,539 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:35:46,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 60 transitions. [2018-11-18 10:35:46,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:46,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:46,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:46,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1, 1, 1] [2018-11-18 10:35:46,540 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:46,540 INFO L794 eck$LassoCheckResult]: Stem: 1006#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 991#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 992#L81-4 assume true; 999#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1000#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1008#L81-4 assume true; 1009#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1023#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1022#L81-4 assume true; 1021#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1020#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1019#L81-4 assume true; 1018#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1017#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1016#L81-4 assume true; 1015#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1014#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1013#L81-4 assume true; 1011#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1012#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1010#L81-4 assume true; 997#L81-1 assume !(main_~i~1 < 8); 998#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1004#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 982#L53-4 [2018-11-18 10:35:46,540 INFO L796 eck$LassoCheckResult]: Loop: 982#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 983#L56 assume !parse_expression_list_#t~switch3; 989#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 990#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 987#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 982#L53-4 [2018-11-18 10:35:46,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1278319957, now seen corresponding path program 6 times [2018-11-18 10:35:46,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:46,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:35:46,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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-18 10:35:46,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 10:35:46,673 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 10:35:46,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:35:46,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:35:46,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 10:35:46,705 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:46,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 7 times [2018-11-18 10:35:46,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:46,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:35:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:35:46,756 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-11-18 10:35:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:46,783 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-18 10:35:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:35:46,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2018-11-18 10:35:46,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:46,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 65 transitions. [2018-11-18 10:35:46,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 10:35:46,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:46,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2018-11-18 10:35:46,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:46,786 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-11-18 10:35:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2018-11-18 10:35:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-18 10:35:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 10:35:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-18 10:35:46,789 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-18 10:35:46,789 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-18 10:35:46,789 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 10:35:46,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2018-11-18 10:35:46,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:46,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:46,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:46,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1, 1, 1] [2018-11-18 10:35:46,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:46,791 INFO L794 eck$LassoCheckResult]: Stem: 1194#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1180#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1181#L81-4 assume true; 1187#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1188#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1196#L81-4 assume true; 1197#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1214#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1213#L81-4 assume true; 1212#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1211#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1210#L81-4 assume true; 1209#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1208#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1207#L81-4 assume true; 1206#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1205#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1204#L81-4 assume true; 1203#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1202#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1201#L81-4 assume true; 1199#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1200#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1198#L81-4 assume true; 1185#L81-1 assume !(main_~i~1 < 8); 1186#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1192#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1170#L53-4 [2018-11-18 10:35:46,791 INFO L796 eck$LassoCheckResult]: Loop: 1170#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1171#L56 assume !parse_expression_list_#t~switch3; 1177#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1178#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1175#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1170#L53-4 [2018-11-18 10:35:46,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1098271405, now seen corresponding path program 7 times [2018-11-18 10:35:46,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:46,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:35:46,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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-18 10:35:46,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:46,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:46,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:35:46,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 10:35:46,935 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:46,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 8 times [2018-11-18 10:35:46,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:46,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:35:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:35:46,980 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-18 10:35:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:47,000 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-18 10:35:47,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:35:47,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2018-11-18 10:35:47,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:47,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 67 transitions. [2018-11-18 10:35:47,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-18 10:35:47,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 10:35:47,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 67 transitions. [2018-11-18 10:35:47,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:47,003 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-11-18 10:35:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 67 transitions. [2018-11-18 10:35:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-18 10:35:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 10:35:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-18 10:35:47,005 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-18 10:35:47,005 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-18 10:35:47,005 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 10:35:47,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 66 transitions. [2018-11-18 10:35:47,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-18 10:35:47,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:47,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:47,006 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1, 1, 1] [2018-11-18 10:35:47,006 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:35:47,006 INFO L794 eck$LassoCheckResult]: Stem: 1397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1382#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1383#L81-4 assume true; 1399#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1420#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1400#L81-4 assume true; 1390#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1391#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1401#L81-4 assume true; 1419#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1418#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1417#L81-4 assume true; 1416#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1415#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1414#L81-4 assume true; 1413#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1412#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1411#L81-4 assume true; 1410#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1409#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1408#L81-4 assume true; 1407#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1406#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1405#L81-4 assume true; 1403#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1404#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1402#L81-4 assume true; 1388#L81-1 assume !(main_~i~1 < 8); 1389#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1395#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1373#L53-4 [2018-11-18 10:35:47,006 INFO L796 eck$LassoCheckResult]: Loop: 1373#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1374#L56 assume !parse_expression_list_#t~switch3; 1380#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1381#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1378#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1373#L53-4 [2018-11-18 10:35:47,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -404337813, now seen corresponding path program 8 times [2018-11-18 10:35:47,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:47,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:47,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:47,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 56367616, now seen corresponding path program 9 times [2018-11-18 10:35:47,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:47,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:47,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:47,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:47,033 INFO L82 PathProgramCache]: Analyzing trace with hash -879861546, now seen corresponding path program 1 times [2018-11-18 10:35:47,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:47,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:47,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:47,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:47,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:50,731 WARN L180 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 190 DAG size of output: 149 [2018-11-18 10:35:50,881 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-18 10:35:50,882 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:35:50,882 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:35:50,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:35:50,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:35:50,883 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:35:50,883 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:35:50,883 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:35:50,883 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:35:50,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration10_Lasso [2018-11-18 10:35:50,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:35:50,883 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:35:50,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:50,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35: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-18 10:35:51,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:35:51,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:35:51,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,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-18 10:35:51,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,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-18 10:35:51,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,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-18 10:35:51,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,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-18 10:35:51,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,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-18 10:35:51,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,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-18 10:35:51,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,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-18 10:35:51,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:51,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:51,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:51,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:35:51,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,228 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:35:51,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:51,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:51,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:51,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:51,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:51,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:51,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:51,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:51,244 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:35:51,250 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:35:51,250 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:35:51,251 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:35:51,252 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:35:51,252 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:35:51,252 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2018-11-18 10:35:51,309 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-18 10:35:51,311 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:35:51,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:51,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:51,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:51,358 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:35:51,359 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 66 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-18 10:35:51,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 66 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 84 states and 103 transitions. Complement of second has 4 states. [2018-11-18 10:35:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 10:35:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 10:35:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2018-11-18 10:35:51,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 30 letters. Loop has 5 letters. [2018-11-18 10:35:51,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:51,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 35 letters. Loop has 5 letters. [2018-11-18 10:35:51,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:51,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 30 letters. Loop has 10 letters. [2018-11-18 10:35:51,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:51,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2018-11-18 10:35:51,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:35:51,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 71 states and 87 transitions. [2018-11-18 10:35:51,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 10:35:51,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 10:35:51,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2018-11-18 10:35:51,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:51,387 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-11-18 10:35:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2018-11-18 10:35:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-18 10:35:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 10:35:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-11-18 10:35:51,390 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-11-18 10:35:51,390 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-11-18 10:35:51,390 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 10:35:51,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 86 transitions. [2018-11-18 10:35:51,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:35:51,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:51,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:51,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:51,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:35:51,391 INFO L794 eck$LassoCheckResult]: Stem: 1699#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1681#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1682#L81-4 assume true; 1702#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1704#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1703#L81-4 assume true; 1691#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1692#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1723#L81-4 assume true; 1722#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1721#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1720#L81-4 assume true; 1719#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1718#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1717#L81-4 assume true; 1716#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1715#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1714#L81-4 assume true; 1713#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1712#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1711#L81-4 assume true; 1710#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1709#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1708#L81-4 assume true; 1706#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1707#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1705#L81-4 assume true; 1689#L81-1 assume !(main_~i~1 < 8); 1690#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1696#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1668#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1669#L56 assume parse_expression_list_#t~switch3; 1673#L57-6 [2018-11-18 10:35:51,392 INFO L796 eck$LassoCheckResult]: Loop: 1673#L57-6 assume true; 1674#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1700#L57-2 assume parse_expression_list_#t~short6; 1697#L57-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 1673#L57-6 [2018-11-18 10:35:51,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:51,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2021580818, now seen corresponding path program 1 times [2018-11-18 10:35:51,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:51,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:51,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 1 times [2018-11-18 10:35:51,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:51,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:51,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:51,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1593638568, now seen corresponding path program 1 times [2018-11-18 10:35:51,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:51,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:35:51,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:35:51,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:35:51,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:35:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:35:51,618 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. cyclomatic complexity: 20 Second operand 7 states. [2018-11-18 10:35:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:51,743 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-11-18 10:35:51,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:35:51,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 133 transitions. [2018-11-18 10:35:51,745 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 10:35:51,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 133 transitions. [2018-11-18 10:35:51,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 10:35:51,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 10:35:51,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 133 transitions. [2018-11-18 10:35:51,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:51,746 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-11-18 10:35:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 133 transitions. [2018-11-18 10:35:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-11-18 10:35:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 10:35:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-11-18 10:35:51,750 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-11-18 10:35:51,750 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-11-18 10:35:51,750 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 10:35:51,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 97 transitions. [2018-11-18 10:35:51,750 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:35:51,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:51,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:51,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:51,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:35:51,751 INFO L794 eck$LassoCheckResult]: Stem: 1896#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1879#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1880#L81-4 assume true; 1888#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1889#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1899#L81-4 assume true; 1900#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1920#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1919#L81-4 assume true; 1918#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1917#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1916#L81-4 assume true; 1915#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1914#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1913#L81-4 assume true; 1912#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1911#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1910#L81-4 assume true; 1909#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1908#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1907#L81-4 assume true; 1906#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1905#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1904#L81-4 assume true; 1902#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 1903#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 1901#L81-4 assume true; 1886#L81-1 assume !(main_~i~1 < 8); 1887#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1893#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1864#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1865#L56 assume !parse_expression_list_#t~switch3; 1876#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 1877#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1874#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 1866#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 1867#L56 assume parse_expression_list_#t~switch3; 1924#L57-6 [2018-11-18 10:35:51,752 INFO L796 eck$LassoCheckResult]: Loop: 1924#L57-6 assume true; 1923#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 1921#L57-2 assume parse_expression_list_#t~short6; 1922#L57-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 1924#L57-6 [2018-11-18 10:35:51,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 561612441, now seen corresponding path program 1 times [2018-11-18 10:35:51,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:51,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 2 times [2018-11-18 10:35:51,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:51,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:51,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:51,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:51,783 INFO L82 PathProgramCache]: Analyzing trace with hash 633477763, now seen corresponding path program 1 times [2018-11-18 10:35:51,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:51,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:51,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:51,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:54,779 WARN L180 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 232 DAG size of output: 171 [2018-11-18 10:35:54,913 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-18 10:35:54,914 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:35:54,914 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:35:54,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:35:54,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:35:54,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:35:54,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:35:54,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:35:54,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:35:54,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-18 10:35:54,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:35:54,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:35:54,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:54,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:54,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:54,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-18 10:35:54,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-18 10:35:54,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:54,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:54,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:54,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:54,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-18 10:35:54,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-18 10:35:54,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-18 10:35:54,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-18 10:35:54,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-18 10:35:55,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:35:55,293 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:35:55,293 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:35:55,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:55,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:55,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:55,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:55,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:55,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:55,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:35:55,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:35:55,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:35:55,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:55,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:55,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:55,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:55,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:35:55,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:35:55,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:35:55,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:35:55,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:35:55,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:35:55,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:35:55,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:35:55,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:35:55,339 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:35:55,339 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:35:55,340 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:35:55,341 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 10:35:55,341 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:35:55,341 INFO L520 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-18 10:35:55,407 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-18 10:35:55,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:55,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:55,446 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-18 10:35:55,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:35:55,450 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-18 10:35:55,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:35:55,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:35:55,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2018-11-18 10:35:55,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:35:55,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:35:55,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-18 10:35:55,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:35:55,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:35:55,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:35:55,490 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-18 10:35:55,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:35:55,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:35:55,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2018-11-18 10:35:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:55,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:55,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 10:35:55,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 22 Second operand 6 states. [2018-11-18 10:35:55,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 22. Second operand 6 states. Result 200 states and 261 transitions. Complement of second has 9 states. [2018-11-18 10:35:55,634 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-18 10:35:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:35:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-18 10:35:55,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 61 transitions. Stem has 37 letters. Loop has 4 letters. [2018-11-18 10:35:55,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:55,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 61 transitions. Stem has 41 letters. Loop has 4 letters. [2018-11-18 10:35:55,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:55,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 61 transitions. Stem has 37 letters. Loop has 8 letters. [2018-11-18 10:35:55,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:35:55,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 261 transitions. [2018-11-18 10:35:55,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2018-11-18 10:35:55,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 158 states and 203 transitions. [2018-11-18 10:35:55,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-18 10:35:55,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-18 10:35:55,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 203 transitions. [2018-11-18 10:35:55,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:55,640 INFO L705 BuchiCegarLoop]: Abstraction has 158 states and 203 transitions. [2018-11-18 10:35:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 203 transitions. [2018-11-18 10:35:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 111. [2018-11-18 10:35:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 10:35:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 142 transitions. [2018-11-18 10:35:55,644 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 142 transitions. [2018-11-18 10:35:55,644 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 142 transitions. [2018-11-18 10:35:55,644 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 10:35:55,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 142 transitions. [2018-11-18 10:35:55,644 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:35:55,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:55,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:55,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:55,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:35:55,646 INFO L794 eck$LassoCheckResult]: Stem: 2371#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2353#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2354#L81-4 assume true; 2363#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2364#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2376#L81-4 assume true; 2377#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2399#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2398#L81-4 assume true; 2397#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2396#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2395#L81-4 assume true; 2394#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2393#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2392#L81-4 assume true; 2391#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2390#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2389#L81-4 assume true; 2388#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2387#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2386#L81-4 assume true; 2385#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2384#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2383#L81-4 assume true; 2381#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2382#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2380#L81-4 assume true; 2361#L81-1 assume !(main_~i~1 < 8); 2362#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2368#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2334#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2335#L56 assume parse_expression_list_#t~switch3; 2341#L57-6 assume true; 2342#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2430#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2423#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 2421#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2418#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 2327#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2355#L60-9 [2018-11-18 10:35:55,646 INFO L796 eck$LassoCheckResult]: Loop: 2355#L60-9 assume true; 2332#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2320#L60-2 assume !parse_expression_list_#t~short13; 2322#L60-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;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; 2355#L60-9 [2018-11-18 10:35:55,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 483747906, now seen corresponding path program 1 times [2018-11-18 10:35:55,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:35:55,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:35:55,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:35:55,764 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:35:55,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2803721, now seen corresponding path program 1 times [2018-11-18 10:35:55,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:55,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:55,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:55,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:35:55,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:35:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:35:55,770 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:35:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:35:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:35:55,770 INFO L87 Difference]: Start difference. First operand 111 states and 142 transitions. cyclomatic complexity: 38 Second operand 3 states. [2018-11-18 10:35:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:55,778 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2018-11-18 10:35:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:35:55,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 143 transitions. [2018-11-18 10:35:55,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:35:55,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 112 states and 142 transitions. [2018-11-18 10:35:55,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-18 10:35:55,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-18 10:35:55,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 142 transitions. [2018-11-18 10:35:55,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:55,781 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 142 transitions. [2018-11-18 10:35:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 142 transitions. [2018-11-18 10:35:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-18 10:35:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 10:35:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 142 transitions. [2018-11-18 10:35:55,784 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 142 transitions. [2018-11-18 10:35:55,784 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 142 transitions. [2018-11-18 10:35:55,784 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 10:35:55,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 142 transitions. [2018-11-18 10:35:55,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:35:55,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:55,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:55,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:55,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:35:55,786 INFO L794 eck$LassoCheckResult]: Stem: 2605#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2584#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2585#L81-4 assume true; 2597#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2598#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2609#L81-4 assume true; 2610#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2653#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2651#L81-4 assume true; 2650#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2648#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2646#L81-4 assume true; 2644#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2642#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2638#L81-4 assume true; 2636#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2635#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2634#L81-4 assume true; 2632#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2630#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2628#L81-4 assume true; 2625#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2624#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2622#L81-4 assume true; 2616#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2618#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2615#L81-4 assume true; 2595#L81-1 assume !(main_~i~1 < 8); 2596#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2602#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2568#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2569#L56 assume parse_expression_list_#t~switch3; 2647#L57-6 assume true; 2611#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2606#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2603#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 2572#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2555#L58 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2556#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2588#L60-9 [2018-11-18 10:35:55,786 INFO L796 eck$LassoCheckResult]: Loop: 2588#L60-9 assume true; 2566#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2559#L60-2 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 2560#L60-3 assume parse_expression_list_#t~short12; 2590#L60-5 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 2587#L60-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;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; 2588#L60-9 [2018-11-18 10:35:55,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash 483747968, now seen corresponding path program 1 times [2018-11-18 10:35:55,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:55,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:55,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:55,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:55,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1600868722, now seen corresponding path program 1 times [2018-11-18 10:35:55,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:55,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:55,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:55,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:55,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,808 INFO L82 PathProgramCache]: Analyzing trace with hash -806126643, now seen corresponding path program 1 times [2018-11-18 10:35:55,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:55,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:35:55,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:35:55,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:35:55,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:35:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:35:55,897 INFO L87 Difference]: Start difference. First operand 112 states and 142 transitions. cyclomatic complexity: 37 Second operand 6 states. [2018-11-18 10:35:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:55,942 INFO L93 Difference]: Finished difference Result 166 states and 205 transitions. [2018-11-18 10:35:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:35:55,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 205 transitions. [2018-11-18 10:35:55,943 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:35:55,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 151 states and 189 transitions. [2018-11-18 10:35:55,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 10:35:55,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 10:35:55,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 189 transitions. [2018-11-18 10:35:55,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:55,945 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 189 transitions. [2018-11-18 10:35:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 189 transitions. [2018-11-18 10:35:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2018-11-18 10:35:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 10:35:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2018-11-18 10:35:55,948 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 143 transitions. [2018-11-18 10:35:55,948 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 143 transitions. [2018-11-18 10:35:55,948 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 10:35:55,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 143 transitions. [2018-11-18 10:35:55,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:35:55,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:55,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:55,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:55,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:35:55,950 INFO L794 eck$LassoCheckResult]: Stem: 2901#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2877#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2878#L81-4 assume true; 2890#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2891#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2904#L81-4 assume true; 2905#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2941#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2940#L81-4 assume true; 2939#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2938#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2937#L81-4 assume true; 2936#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2935#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2934#L81-4 assume true; 2933#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2932#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2930#L81-4 assume true; 2928#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2925#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2922#L81-4 assume true; 2919#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2916#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2913#L81-4 assume true; 2909#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 2911#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 2908#L81-4 assume true; 2888#L81-1 assume !(main_~i~1 < 8); 2889#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2896#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2862#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2863#L56 assume !parse_expression_list_#t~switch3; 2931#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 2964#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2963#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 2962#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 2959#L56 assume parse_expression_list_#t~switch3; 2960#L57-6 assume true; 2961#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 2958#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 2955#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 2948#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2850#L58 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 2851#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2881#L60-9 [2018-11-18 10:35:55,950 INFO L796 eck$LassoCheckResult]: Loop: 2881#L60-9 assume true; 2860#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2854#L60-2 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 2855#L60-3 assume parse_expression_list_#t~short12; 2883#L60-5 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 2880#L60-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;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; 2881#L60-9 [2018-11-18 10:35:55,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash -148423819, now seen corresponding path program 1 times [2018-11-18 10:35:55,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:55,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:55,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:55,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:55,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1600868722, now seen corresponding path program 2 times [2018-11-18 10:35:55,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:55,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1719042818, now seen corresponding path program 1 times [2018-11-18 10:35:55,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:55,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:35:56,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:35:56,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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-18 10:35:56,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:35:56,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:35:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:35:56,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:35:56,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-18 10:35:56,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:35:56,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:35:56,146 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. cyclomatic complexity: 35 Second operand 7 states. [2018-11-18 10:35:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:35:56,221 INFO L93 Difference]: Finished difference Result 213 states and 271 transitions. [2018-11-18 10:35:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:35:56,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 271 transitions. [2018-11-18 10:35:56,224 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:35:56,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 195 states and 246 transitions. [2018-11-18 10:35:56,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 10:35:56,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 10:35:56,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 246 transitions. [2018-11-18 10:35:56,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:35:56,225 INFO L705 BuchiCegarLoop]: Abstraction has 195 states and 246 transitions. [2018-11-18 10:35:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 246 transitions. [2018-11-18 10:35:56,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 159. [2018-11-18 10:35:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-18 10:35:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 200 transitions. [2018-11-18 10:35:56,230 INFO L728 BuchiCegarLoop]: Abstraction has 159 states and 200 transitions. [2018-11-18 10:35:56,230 INFO L608 BuchiCegarLoop]: Abstraction has 159 states and 200 transitions. [2018-11-18 10:35:56,230 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 10:35:56,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 200 transitions. [2018-11-18 10:35:56,231 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:35:56,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:35:56,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:35:56,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:35:56,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:35:56,232 INFO L794 eck$LassoCheckResult]: Stem: 3399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3377#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 3378#L81-4 assume true; 3391#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3392#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3403#L81-4 assume true; 3404#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3428#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3427#L81-4 assume true; 3426#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3425#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3424#L81-4 assume true; 3423#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3422#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3421#L81-4 assume true; 3420#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3419#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3418#L81-4 assume true; 3417#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3416#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3415#L81-4 assume true; 3414#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3413#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3412#L81-4 assume true; 3407#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 3409#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 3406#L81-4 assume true; 3389#L81-1 assume !(main_~i~1 < 8); 3390#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 3396#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3360#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3361#L56 assume !parse_expression_list_#t~switch3; 3470#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 3468#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3466#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3464#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3461#L56 assume !parse_expression_list_#t~switch3; 3453#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 3459#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3457#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 3454#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 3452#L56 assume parse_expression_list_#t~switch3; 3450#L57-6 assume true; 3448#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 3445#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 3440#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 3437#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3433#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 3348#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3381#L60-9 [2018-11-18 10:35:56,232 INFO L796 eck$LassoCheckResult]: Loop: 3381#L60-9 assume true; 3357#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 3351#L60-2 assume parse_expression_list_#t~short13;call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short12 := 32 == parse_expression_list_#t~mem10; 3352#L60-3 assume parse_expression_list_#t~short12; 3383#L60-5 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 3380#L60-7 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;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; 3381#L60-9 [2018-11-18 10:35:56,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash -482608798, now seen corresponding path program 1 times [2018-11-18 10:35:56,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:56,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:56,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:56,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1600868722, now seen corresponding path program 3 times [2018-11-18 10:35:56,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:56,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:56,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:56,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:35:56,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:56,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:35:56,278 INFO L82 PathProgramCache]: Analyzing trace with hash -428975313, now seen corresponding path program 1 times [2018-11-18 10:35:56,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:35:56,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:35:56,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:56,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:35:56,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:35:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:35:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:01,444 WARN L180 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 287 DAG size of output: 202 [2018-11-18 10:36:01,599 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-18 10:36:01,600 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:36:01,600 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:36:01,600 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:36:01,600 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:36:01,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:36:01,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:36:01,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:36:01,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:36:01,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration16_Lasso [2018-11-18 10:36:01,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:36:01,601 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:36:01,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:36:01,959 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:36:01,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:36:01,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-18 10:36:01,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:36:01,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:36:01,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:36:01,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:36:01,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:36:01,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:36:01,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,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-18 10:36:01,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:36:01,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:36:01,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:36:01,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:36:01,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:36:01,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:36:01,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:36:01,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:36:01,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:36:01,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:36:01,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,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-18 10:36:01,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:36:01,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:36:01,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:36:01,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:36:01,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,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-18 10:36:01,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:36:01,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,974 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:36:01,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,975 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:36:01,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,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-18 10:36:01,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,979 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:36:01,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:36:01,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,984 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:36:01,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,985 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:36:01,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:36:01,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:36:01,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,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-18 10:36:01,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:36:01,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:01,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:36:01,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:36:01,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:36:01,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:36:01,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:36:01,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:36:01,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:36:01,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:36:02,007 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:36:02,013 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:36:02,013 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 10:36:02,014 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:36:02,014 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:36:02,014 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:36:02,015 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2018-11-18 10:36:02,105 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 10:36:02,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:36:02,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:36:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:36:02,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:36:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:36:02,198 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:36:02,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 200 transitions. cyclomatic complexity: 51 Second operand 5 states. [2018-11-18 10:36:02,314 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 200 transitions. cyclomatic complexity: 51. Second operand 5 states. Result 331 states and 426 transitions. Complement of second has 11 states. [2018-11-18 10:36:02,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 10:36:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:36:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-18 10:36:02,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 85 transitions. Stem has 49 letters. Loop has 6 letters. [2018-11-18 10:36:02,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:36:02,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 85 transitions. Stem has 55 letters. Loop has 6 letters. [2018-11-18 10:36:02,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:36:02,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 85 transitions. Stem has 49 letters. Loop has 12 letters. [2018-11-18 10:36:02,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:36:02,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 426 transitions. [2018-11-18 10:36:02,319 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2018-11-18 10:36:02,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 222 states and 282 transitions. [2018-11-18 10:36:02,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-18 10:36:02,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 10:36:02,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 282 transitions. [2018-11-18 10:36:02,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:36:02,321 INFO L705 BuchiCegarLoop]: Abstraction has 222 states and 282 transitions. [2018-11-18 10:36:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 282 transitions. [2018-11-18 10:36:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 165. [2018-11-18 10:36:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-18 10:36:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2018-11-18 10:36:02,323 INFO L728 BuchiCegarLoop]: Abstraction has 165 states and 207 transitions. [2018-11-18 10:36:02,323 INFO L608 BuchiCegarLoop]: Abstraction has 165 states and 207 transitions. [2018-11-18 10:36:02,323 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 10:36:02,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 207 transitions. [2018-11-18 10:36:02,323 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:36:02,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:36:02,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:36:02,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 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] [2018-11-18 10:36:02,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:36:02,324 INFO L794 eck$LassoCheckResult]: Stem: 4125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4097#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 4098#L81-4 assume true; 4115#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4116#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4129#L81-4 assume true; 4130#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4150#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4149#L81-4 assume true; 4148#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4147#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4146#L81-4 assume true; 4145#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4144#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4143#L81-4 assume true; 4142#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4141#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4140#L81-4 assume true; 4139#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4138#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4137#L81-4 assume true; 4136#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4135#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4134#L81-4 assume true; 4132#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4133#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4131#L81-4 assume true; 4113#L81-1 assume !(main_~i~1 < 8); 4114#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 4121#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4082#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4083#L56 assume parse_expression_list_#t~switch3; 4184#L57-6 assume true; 4182#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 4180#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 4178#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 4176#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 4174#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 4173#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4172#L60-9 assume true; 4171#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4170#L60-2 assume !parse_expression_list_#t~short13; 4169#L60-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12; 4168#L60-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 4167#L61 assume !parse_expression_list_#t~short16; 4166#L61-2 assume parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;parse_expression_list_#t~post17 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post17 - 1;havoc parse_expression_list_#t~post17; 4165#L61-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4164#L63 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4163#L5 assume !(0 == __VERIFIER_assert_~cond); 4162#L5-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 4161#L62 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4160#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 4159#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4158#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 4157#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4155#L56 assume parse_expression_list_#t~switch3; 4123#L57-6 [2018-11-18 10:36:02,324 INFO L796 eck$LassoCheckResult]: Loop: 4123#L57-6 assume true; 4154#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 4153#L57-2 assume parse_expression_list_#t~short6; 4122#L57-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 4123#L57-6 [2018-11-18 10:36:02,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,325 INFO L82 PathProgramCache]: Analyzing trace with hash 302931493, now seen corresponding path program 1 times [2018-11-18 10:36:02,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:36:02,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:36:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:36:02,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:36:02,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:36:02,361 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:36:02,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 3 times [2018-11-18 10:36:02,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:36:02,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:36:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:36:02,406 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. cyclomatic complexity: 52 Second operand 3 states. [2018-11-18 10:36:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:36:02,414 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2018-11-18 10:36:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:36:02,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 210 transitions. [2018-11-18 10:36:02,416 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:36:02,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 168 states and 209 transitions. [2018-11-18 10:36:02,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 10:36:02,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 10:36:02,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 209 transitions. [2018-11-18 10:36:02,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:36:02,418 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 209 transitions. [2018-11-18 10:36:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 209 transitions. [2018-11-18 10:36:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-11-18 10:36:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-18 10:36:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2018-11-18 10:36:02,421 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 207 transitions. [2018-11-18 10:36:02,421 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 207 transitions. [2018-11-18 10:36:02,421 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 10:36:02,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 207 transitions. [2018-11-18 10:36:02,422 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:36:02,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:36:02,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:36:02,423 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 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] [2018-11-18 10:36:02,423 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:36:02,423 INFO L794 eck$LassoCheckResult]: Stem: 4464#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4438#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 4439#L81-4 assume true; 4454#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4455#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4470#L81-4 assume true; 4471#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4521#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4518#L81-4 assume true; 4516#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4514#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4512#L81-4 assume true; 4510#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4508#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4505#L81-4 assume true; 4502#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4500#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4498#L81-4 assume true; 4495#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4493#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4491#L81-4 assume true; 4488#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4484#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4482#L81-4 assume true; 4477#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4479#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4476#L81-4 assume true; 4452#L81-1 assume !(main_~i~1 < 8); 4453#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 4461#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4423#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4424#L56 assume parse_expression_list_#t~switch3; 4528#L57-6 assume true; 4529#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 4530#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 4527#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 4525#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 4519#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 4517#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4515#L60-9 assume true; 4513#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4511#L60-2 assume !parse_expression_list_#t~short13; 4509#L60-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12; 4507#L60-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 4506#L61 assume parse_expression_list_#t~short16;call parse_expression_list_#t~mem15 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 34 == parse_expression_list_#t~mem15; 4504#L61-2 assume parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15;parse_expression_list_#t~post17 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post17 - 1;havoc parse_expression_list_#t~post17; 4501#L61-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4499#L63 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4497#L5 assume !(0 == __VERIFIER_assert_~cond); 4496#L5-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 4435#L62 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4436#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 4494#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4492#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 4489#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4485#L56 assume parse_expression_list_#t~switch3; 4431#L57-6 [2018-11-18 10:36:02,423 INFO L796 eck$LassoCheckResult]: Loop: 4431#L57-6 assume true; 4432#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 4467#L57-2 assume parse_expression_list_#t~short6; 4462#L57-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 4431#L57-6 [2018-11-18 10:36:02,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash 44766055, now seen corresponding path program 1 times [2018-11-18 10:36:02,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:36:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:36:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:36:02,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:36:02,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:36:02,476 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:36:02,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 4 times [2018-11-18 10:36:02,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:36:02,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:02,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:36:02,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:36:02,520 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. cyclomatic complexity: 51 Second operand 5 states. [2018-11-18 10:36:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:36:02,551 INFO L93 Difference]: Finished difference Result 193 states and 240 transitions. [2018-11-18 10:36:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:36:02,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 240 transitions. [2018-11-18 10:36:02,553 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 10:36:02,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 193 states and 240 transitions. [2018-11-18 10:36:02,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 10:36:02,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 10:36:02,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 240 transitions. [2018-11-18 10:36:02,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:36:02,554 INFO L705 BuchiCegarLoop]: Abstraction has 193 states and 240 transitions. [2018-11-18 10:36:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 240 transitions. [2018-11-18 10:36:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 167. [2018-11-18 10:36:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-18 10:36:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2018-11-18 10:36:02,558 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 206 transitions. [2018-11-18 10:36:02,558 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 206 transitions. [2018-11-18 10:36:02,558 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 10:36:02,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 206 transitions. [2018-11-18 10:36:02,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:36:02,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:36:02,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:36:02,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 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] [2018-11-18 10:36:02,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:36:02,560 INFO L794 eck$LassoCheckResult]: Stem: 4833#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4807#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 4808#L81-4 assume true; 4821#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4822#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4837#L81-4 assume true; 4838#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4859#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4858#L81-4 assume true; 4857#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4856#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4855#L81-4 assume true; 4854#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4853#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4852#L81-4 assume true; 4851#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4850#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4849#L81-4 assume true; 4848#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4847#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4846#L81-4 assume true; 4845#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4844#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4843#L81-4 assume true; 4841#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 4842#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 4840#L81-4 assume true; 4819#L81-1 assume !(main_~i~1 < 8); 4820#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 4829#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4791#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4792#L56 assume parse_expression_list_#t~switch3; 4901#L57-6 assume true; 4899#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 4897#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 4895#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 4893#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 4891#L58 assume 34 == parse_expression_list_#t~mem8;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post9;havoc parse_expression_list_#t~post9; 4890#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4889#L60-9 assume true; 4888#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4887#L60-2 assume !parse_expression_list_#t~short13; 4886#L60-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12; 4885#L60-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 4884#L61 assume !parse_expression_list_#t~short16; 4883#L61-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 4882#L61-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4881#L63 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4880#L5 assume !(0 == __VERIFIER_assert_~cond); 4879#L5-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 4877#L62 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4876#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 4874#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4872#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 4870#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 4867#L56 assume parse_expression_list_#t~switch3; 4831#L57-6 [2018-11-18 10:36:02,560 INFO L796 eck$LassoCheckResult]: Loop: 4831#L57-6 assume true; 4863#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 4861#L57-2 assume parse_expression_list_#t~short6; 4830#L57-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 4831#L57-6 [2018-11-18 10:36:02,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1003996071, now seen corresponding path program 1 times [2018-11-18 10:36:02,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:36:02,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:36:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:36:02,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:36:02,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:36:02,610 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:36:02,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 5 times [2018-11-18 10:36:02,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:36:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:02,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:36:02,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:36:02,642 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-18 10:36:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:36:02,706 INFO L93 Difference]: Finished difference Result 180 states and 218 transitions. [2018-11-18 10:36:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:36:02,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 218 transitions. [2018-11-18 10:36:02,709 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:36:02,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 166 states and 204 transitions. [2018-11-18 10:36:02,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 10:36:02,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 10:36:02,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 204 transitions. [2018-11-18 10:36:02,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:36:02,710 INFO L705 BuchiCegarLoop]: Abstraction has 166 states and 204 transitions. [2018-11-18 10:36:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 204 transitions. [2018-11-18 10:36:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-11-18 10:36:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-18 10:36:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2018-11-18 10:36:02,712 INFO L728 BuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2018-11-18 10:36:02,712 INFO L608 BuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2018-11-18 10:36:02,712 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 10:36:02,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions. [2018-11-18 10:36:02,712 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 10:36:02,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:36:02,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:36:02,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 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] [2018-11-18 10:36:02,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:36:02,713 INFO L794 eck$LassoCheckResult]: Stem: 5190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5164#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 5165#L81-4 assume true; 5181#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5182#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5195#L81-4 assume true; 5196#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5281#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5279#L81-4 assume true; 5277#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5274#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5227#L81-4 assume true; 5225#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5224#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5223#L81-4 assume true; 5222#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5220#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5218#L81-4 assume true; 5217#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5215#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5213#L81-4 assume true; 5211#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5209#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5205#L81-4 assume true; 5201#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5203#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5200#L81-4 assume true; 5179#L81-1 assume !(main_~i~1 < 8); 5180#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 5187#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 5149#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 5150#L56 assume parse_expression_list_#t~switch3; 5266#L57-6 assume true; 5264#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 5263#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 5260#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 5257#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 5253#L58 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 5250#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 5247#L60-9 assume true; 5245#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 5243#L60-2 assume !parse_expression_list_#t~short13; 5241#L60-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12; 5239#L60-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 5237#L61 assume !parse_expression_list_#t~short16; 5235#L61-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 5232#L61-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 5230#L63 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5228#L5 assume !(0 == __VERIFIER_assert_~cond); 5176#L5-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 5177#L62 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 5216#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 5214#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5212#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 5210#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 5206#L56 assume parse_expression_list_#t~switch3; 5156#L57-6 [2018-11-18 10:36:02,713 INFO L796 eck$LassoCheckResult]: Loop: 5156#L57-6 assume true; 5157#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 5192#L57-2 assume parse_expression_list_#t~short6; 5188#L57-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 5156#L57-6 [2018-11-18 10:36:02,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash -684947671, now seen corresponding path program 1 times [2018-11-18 10:36:02,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:36:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:36:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 10:36:02,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:36:02,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:36:02,770 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:36:02,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 6 times [2018-11-18 10:36:02,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:36:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:02,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:36:02,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:36:02,806 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. cyclomatic complexity: 48 Second operand 7 states. [2018-11-18 10:36:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:36:02,884 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2018-11-18 10:36:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:36:02,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 174 transitions. [2018-11-18 10:36:02,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:36:02,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 128 states and 159 transitions. [2018-11-18 10:36:02,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 10:36:02,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 10:36:02,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 159 transitions. [2018-11-18 10:36:02,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:36:02,887 INFO L705 BuchiCegarLoop]: Abstraction has 128 states and 159 transitions. [2018-11-18 10:36:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 159 transitions. [2018-11-18 10:36:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-18 10:36:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 10:36:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2018-11-18 10:36:02,889 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 159 transitions. [2018-11-18 10:36:02,889 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 159 transitions. [2018-11-18 10:36:02,889 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 10:36:02,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 159 transitions. [2018-11-18 10:36:02,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 10:36:02,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:36:02,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:36:02,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 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] [2018-11-18 10:36:02,891 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:36:02,891 INFO L794 eck$LassoCheckResult]: Stem: 5510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5488#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;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 5489#L81-4 assume true; 5501#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5502#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5513#L81-4 assume true; 5514#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5587#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5586#L81-4 assume true; 5585#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5584#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5583#L81-4 assume true; 5582#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5581#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5580#L81-4 assume true; 5579#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5578#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5577#L81-4 assume true; 5576#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5575#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5574#L81-4 assume true; 5573#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5572#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5571#L81-4 assume true; 5569#L81-1 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet20, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet20; 5570#L81-3 main_#t~post19 := main_~i~1;main_~i~1 := 1 + main_#t~post19;havoc main_#t~post19; 5568#L81-4 assume true; 5499#L81-1 assume !(main_~i~1 < 8); 5500#L81-5 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 5507#L52 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 5472#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 5473#L56 assume !parse_expression_list_#t~switch3; 5498#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 5567#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5566#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 5565#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 5563#L56 assume parse_expression_list_#t~switch3; 5480#L57-6 assume true; 5481#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 5512#L57-2 assume !parse_expression_list_#t~short6;call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 9 == parse_expression_list_#t~mem5; 5509#L57-4 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4; 5477#L57-7 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 5462#L58 assume !(34 == parse_expression_list_#t~mem8);havoc parse_expression_list_#t~mem8; 5463#L58-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 5497#L60-9 assume true; 5506#L60-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 5527#L60-2 assume !parse_expression_list_#t~short13; 5525#L60-7 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12; 5522#L60-10 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 5520#L61 assume !parse_expression_list_#t~short16; 5516#L61-2 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 5504#L61-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 5487#L63 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);call parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy(parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0));havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5468#L5 assume !(0 == __VERIFIER_assert_~cond); 5469#L5-2 assume { :end_inline___VERIFIER_assert } true;call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 5484#L62 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 5485#L55 havoc parse_expression_list_#t~mem2;havoc parse_expression_list_#t~switch3; 5486#L53-1 call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5483#L53-2 assume !!(0 != parse_expression_list_#t~mem0);havoc parse_expression_list_#t~mem0; 5474#L53-4 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post1;havoc parse_expression_list_#t~post1;call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch3 := 0 == parse_expression_list_#t~mem2; 5475#L56 assume parse_expression_list_#t~switch3; 5478#L57-6 [2018-11-18 10:36:02,891 INFO L796 eck$LassoCheckResult]: Loop: 5478#L57-6 assume true; 5479#L57-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short6 := 32 == parse_expression_list_#t~mem4; 5511#L57-2 assume parse_expression_list_#t~short6; 5508#L57-4 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem4;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post7;havoc parse_expression_list_#t~post7; 5478#L57-6 [2018-11-18 10:36:02,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1810473772, now seen corresponding path program 1 times [2018-11-18 10:36:02,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:02,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:02,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:36:02,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:36:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 10:36:03,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:36:03,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0af6bf72-343c-486f-ba39-c2aa902c30db/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-18 10:36:03,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:36:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:36:03,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:36:03,054 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-18 10:36:03,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 10:36:03,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:36:03,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:36:03,072 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-18 10:36:03,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-18 10:36:03,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 10:36:03,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 10:36:03,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 10:36:03,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2018-11-18 10:36:03,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-18 10:36:03,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-18 10:36:03,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,148 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:36:03,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 10:36:03,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:36:03,155 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2018-11-18 10:36:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 10:36:03,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:36:03,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2018-11-18 10:36:03,181 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:36:03,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:36:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 7 times [2018-11-18 10:36:03,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:36:03,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:36:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:03,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:36:03,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:36:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:36:03,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:36:03,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:36:03,218 INFO L87 Difference]: Start difference. First operand 128 states and 159 transitions. cyclomatic complexity: 39 Second operand 12 states. [2018-11-18 10:36:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:36:03,368 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2018-11-18 10:36:03,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:36:03,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 113 transitions. [2018-11-18 10:36:03,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:36:03,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 0 states and 0 transitions. [2018-11-18 10:36:03,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:36:03,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:36:03,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:36:03,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:36:03,370 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:36:03,370 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:36:03,370 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:36:03,370 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 10:36:03,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:36:03,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:36:03,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:36:03,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:36:03 BoogieIcfgContainer [2018-11-18 10:36:03,376 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:36:03,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:36:03,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:36:03,376 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:36:03,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:35:44" (3/4) ... [2018-11-18 10:36:03,380 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:36:03,380 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:36:03,381 INFO L168 Benchmark]: Toolchain (without parser) took 19363.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 248.5 MB). Free memory was 959.2 MB in the beginning and 1.2 GB in the end (delta: -266.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:36:03,381 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:36:03,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.85 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:36:03,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:36:03,382 INFO L168 Benchmark]: Boogie Preprocessor took 23.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:36:03,383 INFO L168 Benchmark]: RCFGBuilder took 310.08 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:36:03,383 INFO L168 Benchmark]: BuchiAutomizer took 18740.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:36:03,383 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 304.2 kB). Peak memory consumption was 304.2 kB. Max. memory is 11.5 GB. [2018-11-18 10:36:03,386 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 204.85 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.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 76.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 310.08 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18740.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 304.2 kB). Peak memory consumption was 304.2 kB. 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 21 terminating modules (17 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 unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 3 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. 17 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.7s and 22 iterations. TraceHistogramMax:9. Analysis of lassos took 17.0s. Construction of modules took 0.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 20. Automata minimization 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 251 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 167 states and ocurred in iteration 18. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 840 SDtfs, 906 SDslu, 2466 SDs, 0 SdLazy, 767 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU13 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax100 hnf100 lsp92 ukn56 mio100 lsp53 div100 bol100 ite100 ukn100 eq166 hnf88 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 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...